./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/safe030_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 1730fa7f98e17ee8b58920ef3daf63ee88225f1b42924032a532b5f5db33fba5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:54:20,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:54:20,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:54:20,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:54:20,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:54:20,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:54:20,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:54:20,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:54:20,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:54:20,993 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:54:20,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:54:20,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:54:20,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:54:20,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:54:20,994 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:54:20,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:54:20,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:54:20,994 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:54:20,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:54:20,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:54:20,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:54:20,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:54:20,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:54:20,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:54:20,995 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:54:20,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:54:20,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:54:20,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:20,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:54:20,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:54:20,996 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 -> 1730fa7f98e17ee8b58920ef3daf63ee88225f1b42924032a532b5f5db33fba5 [2025-03-14 00:54:21,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:54:21,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:54:21,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:54:21,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:54:21,237 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:54:21,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_tso.i [2025-03-14 00:54:22,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4e6cbf22/437ff8ecb9de478c8a20f92792aad816/FLAG6b0176232 [2025-03-14 00:54:22,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:54:22,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_tso.i [2025-03-14 00:54:22,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4e6cbf22/437ff8ecb9de478c8a20f92792aad816/FLAG6b0176232 [2025-03-14 00:54:23,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4e6cbf22/437ff8ecb9de478c8a20f92792aad816 [2025-03-14 00:54:23,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:54:23,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:54:23,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:23,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:54:23,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:54:23,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2b30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23, skipping insertion in model container [2025-03-14 00:54:23,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:54:23,242 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/safe030_tso.i[945,958] [2025-03-14 00:54:23,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:23,346 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:54:23,353 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/safe030_tso.i[945,958] [2025-03-14 00:54:23,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:23,398 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:54:23,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23 WrapperNode [2025-03-14 00:54:23,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:23,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:23,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:54:23,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:54:23,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,425 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-03-14 00:54:23,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:23,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:54:23,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:54:23,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:54:23,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,441 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-14 00:54:23,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:54:23,449 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:54:23,449 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:54:23,449 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:54:23,450 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (1/1) ... [2025-03-14 00:54:23,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:23,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:54:23,472 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-14 00:54:23,477 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-14 00:54:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:54:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:54:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-14 00:54:23,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-14 00:54:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-14 00:54:23,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-14 00:54:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-14 00:54:23,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-14 00:54:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:54:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:54:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:54:23,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:54:23,490 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:54:23,574 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:54:23,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:54:23,691 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:54:23,692 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:54:23,692 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:54:23,785 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:54:23,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:23 BoogieIcfgContainer [2025-03-14 00:54:23,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:54:23,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:54:23,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:54:23,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:54:23,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:54:23" (1/3) ... [2025-03-14 00:54:23,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4b98b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:23, skipping insertion in model container [2025-03-14 00:54:23,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:23" (2/3) ... [2025-03-14 00:54:23,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4b98b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:23, skipping insertion in model container [2025-03-14 00:54:23,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:23" (3/3) ... [2025-03-14 00:54:23,796 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_tso.i [2025-03-14 00:54:23,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:54:23,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_tso.i that has 4 procedures, 38 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-14 00:54:23,810 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:54:23,855 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:54:23,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2025-03-14 00:54:23,910 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-03-14 00:54:23,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:23,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-14 00:54:23,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2025-03-14 00:54:23,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-03-14 00:54:23,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:23,949 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;@3cf49e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:23,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:54:23,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:23,967 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-14 00:54:23,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:23,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:23,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:23,969 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-14 00:54:23,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:23,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1594655018, now seen corresponding path program 1 times [2025-03-14 00:54:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:23,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355863888] [2025-03-14 00:54:23,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:23,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:24,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:54:24,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:54:24,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:24,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:24,391 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-14 00:54:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355863888] [2025-03-14 00:54:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355863888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:24,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:24,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191499395] [2025-03-14 00:54:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:24,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:24,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:24,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:24,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:54:24,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-14 00:54:24,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:24,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:54:24,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:25,413 INFO L124 PetriNetUnfolderBase]: 7141/10339 cut-off events. [2025-03-14 00:54:25,414 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-14 00:54:25,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20685 conditions, 10339 events. 7141/10339 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 56883 event pairs, 3097 based on Foata normal form. 300/10629 useless extension candidates. Maximal degree in co-relation 20674. Up to 5674 conditions per place. [2025-03-14 00:54:25,454 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 46 selfloop transitions, 7 changer transitions 63/120 dead transitions. [2025-03-14 00:54:25,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 120 transitions, 487 flow [2025-03-14 00:54:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:54:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:54:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2025-03-14 00:54:25,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6278195488721805 [2025-03-14 00:54:25,468 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 7 states and 167 transitions. [2025-03-14 00:54:25,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 120 transitions, 487 flow [2025-03-14 00:54:25,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 120 transitions, 482 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:54:25,478 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 156 flow [2025-03-14 00:54:25,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-03-14 00:54:25,482 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2025-03-14 00:54:25,483 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 156 flow [2025-03-14 00:54:25,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-14 00:54:25,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:25,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:25,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:54:25,484 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-14 00:54:25,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash -257814485, now seen corresponding path program 1 times [2025-03-14 00:54:25,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:25,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22291778] [2025-03-14 00:54:25,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:25,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:25,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:54:25,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:54:25,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:25,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:25,711 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-14 00:54:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:25,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22291778] [2025-03-14 00:54:25,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22291778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:25,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:25,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499431306] [2025-03-14 00:54:25,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:25,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:25,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:25,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:25,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:25,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:54:25,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:54:25,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:25,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:54:25,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:26,533 INFO L124 PetriNetUnfolderBase]: 6699/9789 cut-off events. [2025-03-14 00:54:26,534 INFO L125 PetriNetUnfolderBase]: For 11921/11924 co-relation queries the response was YES. [2025-03-14 00:54:26,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29031 conditions, 9789 events. 6699/9789 cut-off events. For 11921/11924 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 55418 event pairs, 1117 based on Foata normal form. 288/10074 useless extension candidates. Maximal degree in co-relation 29015. Up to 5476 conditions per place. [2025-03-14 00:54:26,659 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 60 selfloop transitions, 11 changer transitions 86/161 dead transitions. [2025-03-14 00:54:26,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 161 transitions, 988 flow [2025-03-14 00:54:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 220 transitions. [2025-03-14 00:54:26,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-03-14 00:54:26,661 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 156 flow. Second operand 10 states and 220 transitions. [2025-03-14 00:54:26,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 161 transitions, 988 flow [2025-03-14 00:54:26,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 161 transitions, 924 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:26,694 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 266 flow [2025-03-14 00:54:26,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=266, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-03-14 00:54:26,695 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2025-03-14 00:54:26,695 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 266 flow [2025-03-14 00:54:26,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:54:26,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:26,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:26,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:54:26,696 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-14 00:54:26,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash -80498453, now seen corresponding path program 1 times [2025-03-14 00:54:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:26,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114678705] [2025-03-14 00:54:26,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:26,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:54:26,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:54:26,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:26,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:26,816 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-14 00:54:26,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114678705] [2025-03-14 00:54:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114678705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:26,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:26,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784033905] [2025-03-14 00:54:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:26,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:26,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:26,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:26,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:26,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:54:26,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:54:26,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:26,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:54:26,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:27,754 INFO L124 PetriNetUnfolderBase]: 6332/9253 cut-off events. [2025-03-14 00:54:27,754 INFO L125 PetriNetUnfolderBase]: For 29667/29673 co-relation queries the response was YES. [2025-03-14 00:54:27,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32397 conditions, 9253 events. 6332/9253 cut-off events. For 29667/29673 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 50252 event pairs, 1765 based on Foata normal form. 233/9483 useless extension candidates. Maximal degree in co-relation 32372. Up to 5364 conditions per place. [2025-03-14 00:54:27,791 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 65 selfloop transitions, 17 changer transitions 78/164 dead transitions. [2025-03-14 00:54:27,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 164 transitions, 1164 flow [2025-03-14 00:54:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2025-03-14 00:54:27,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5631578947368421 [2025-03-14 00:54:27,794 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 266 flow. Second operand 10 states and 214 transitions. [2025-03-14 00:54:27,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 164 transitions, 1164 flow [2025-03-14 00:54:27,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 164 transitions, 1132 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-14 00:54:27,826 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 438 flow [2025-03-14 00:54:27,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=438, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2025-03-14 00:54:27,827 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2025-03-14 00:54:27,827 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 438 flow [2025-03-14 00:54:27,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:54:27,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:27,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:27,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:54:27,828 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-14 00:54:27,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1547384118, now seen corresponding path program 1 times [2025-03-14 00:54:27,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:27,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756980730] [2025-03-14 00:54:27,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:27,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:27,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:54:27,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:54:27,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:27,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:27,972 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-14 00:54:27,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:27,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756980730] [2025-03-14 00:54:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756980730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:27,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:27,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003956279] [2025-03-14 00:54:27,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:27,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:27,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:27,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:27,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:27,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:54:27,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-14 00:54:27,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:27,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:54:27,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:28,794 INFO L124 PetriNetUnfolderBase]: 6003/8776 cut-off events. [2025-03-14 00:54:28,795 INFO L125 PetriNetUnfolderBase]: For 45312/45318 co-relation queries the response was YES. [2025-03-14 00:54:28,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35243 conditions, 8776 events. 6003/8776 cut-off events. For 45312/45318 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 46763 event pairs, 901 based on Foata normal form. 182/8951 useless extension candidates. Maximal degree in co-relation 35207. Up to 5256 conditions per place. [2025-03-14 00:54:28,849 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 64 selfloop transitions, 22 changer transitions 64/154 dead transitions. [2025-03-14 00:54:28,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 154 transitions, 1326 flow [2025-03-14 00:54:28,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2025-03-14 00:54:28,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210526315789473 [2025-03-14 00:54:28,851 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 438 flow. Second operand 10 states and 198 transitions. [2025-03-14 00:54:28,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 154 transitions, 1326 flow [2025-03-14 00:54:28,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 154 transitions, 1274 flow, removed 26 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:28,972 INFO L231 Difference]: Finished difference. Result has 83 places, 62 transitions, 620 flow [2025-03-14 00:54:28,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=620, PETRI_PLACES=83, PETRI_TRANSITIONS=62} [2025-03-14 00:54:28,972 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2025-03-14 00:54:28,972 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 62 transitions, 620 flow [2025-03-14 00:54:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-14 00:54:28,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:28,973 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-14 00:54:28,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:54:28,973 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-14 00:54:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1293037522, now seen corresponding path program 1 times [2025-03-14 00:54:28,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:28,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475748] [2025-03-14 00:54:28,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:28,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:54:28,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:54:28,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:29,093 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-14 00:54:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:29,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475748] [2025-03-14 00:54:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:29,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:29,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:54:29,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828063923] [2025-03-14 00:54:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:29,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:29,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:29,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:29,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:54:29,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 62 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:54:29,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:29,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:54:29,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:30,140 INFO L124 PetriNetUnfolderBase]: 8308/12194 cut-off events. [2025-03-14 00:54:30,140 INFO L125 PetriNetUnfolderBase]: For 82600/82600 co-relation queries the response was YES. [2025-03-14 00:54:30,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51453 conditions, 12194 events. 8308/12194 cut-off events. For 82600/82600 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 70391 event pairs, 1723 based on Foata normal form. 252/12438 useless extension candidates. Maximal degree in co-relation 51410. Up to 4442 conditions per place. [2025-03-14 00:54:30,198 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 72 selfloop transitions, 26 changer transitions 75/177 dead transitions. [2025-03-14 00:54:30,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 177 transitions, 1636 flow [2025-03-14 00:54:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2025-03-14 00:54:30,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5657894736842105 [2025-03-14 00:54:30,201 INFO L175 Difference]: Start difference. First operand has 83 places, 62 transitions, 620 flow. Second operand 10 states and 215 transitions. [2025-03-14 00:54:30,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 177 transitions, 1636 flow [2025-03-14 00:54:30,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 177 transitions, 1578 flow, removed 29 selfloop flow, removed 6 redundant places. [2025-03-14 00:54:30,315 INFO L231 Difference]: Finished difference. Result has 89 places, 62 transitions, 726 flow [2025-03-14 00:54:30,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=726, PETRI_PLACES=89, PETRI_TRANSITIONS=62} [2025-03-14 00:54:30,315 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2025-03-14 00:54:30,316 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 62 transitions, 726 flow [2025-03-14 00:54:30,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:54:30,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:30,316 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-14 00:54:30,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:54:30,316 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-14 00:54:30,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash 118179500, now seen corresponding path program 1 times [2025-03-14 00:54:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:30,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721644577] [2025-03-14 00:54:30,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:30,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:54:30,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:54:30,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:30,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:30,421 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-14 00:54:30,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:30,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721644577] [2025-03-14 00:54:30,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721644577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:30,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:30,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:54:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847264891] [2025-03-14 00:54:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:30,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:30,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:30,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:30,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:54:30,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 62 transitions, 726 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:54:30,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:30,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:54:30,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:31,465 INFO L124 PetriNetUnfolderBase]: 11091/16321 cut-off events. [2025-03-14 00:54:31,465 INFO L125 PetriNetUnfolderBase]: For 126422/126422 co-relation queries the response was YES. [2025-03-14 00:54:31,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69349 conditions, 16321 events. 11091/16321 cut-off events. For 126422/126422 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 99337 event pairs, 2436 based on Foata normal form. 252/16569 useless extension candidates. Maximal degree in co-relation 69316. Up to 6772 conditions per place. [2025-03-14 00:54:31,572 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 70 selfloop transitions, 25 changer transitions 78/177 dead transitions. [2025-03-14 00:54:31,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 177 transitions, 1864 flow [2025-03-14 00:54:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2025-03-14 00:54:31,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5605263157894737 [2025-03-14 00:54:31,574 INFO L175 Difference]: Start difference. First operand has 89 places, 62 transitions, 726 flow. Second operand 10 states and 213 transitions. [2025-03-14 00:54:31,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 177 transitions, 1864 flow [2025-03-14 00:54:31,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 177 transitions, 1800 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-03-14 00:54:31,851 INFO L231 Difference]: Finished difference. Result has 96 places, 61 transitions, 826 flow [2025-03-14 00:54:31,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=826, PETRI_PLACES=96, PETRI_TRANSITIONS=61} [2025-03-14 00:54:31,851 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2025-03-14 00:54:31,852 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 61 transitions, 826 flow [2025-03-14 00:54:31,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:54:31,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:31,852 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-14 00:54:31,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:54:31,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:31,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash 824817756, now seen corresponding path program 1 times [2025-03-14 00:54:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:31,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201524068] [2025-03-14 00:54:31,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:31,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:31,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:54:31,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:54:31,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:31,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:31,965 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-14 00:54:31,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:31,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201524068] [2025-03-14 00:54:31,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201524068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914541472] [2025-03-14 00:54:31,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:31,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:31,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:31,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:31,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:54:31,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 61 transitions, 826 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:31,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:31,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:54:31,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:33,390 INFO L124 PetriNetUnfolderBase]: 14770/22151 cut-off events. [2025-03-14 00:54:33,391 INFO L125 PetriNetUnfolderBase]: For 180123/180129 co-relation queries the response was YES. [2025-03-14 00:54:33,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89750 conditions, 22151 events. 14770/22151 cut-off events. For 180123/180129 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 145902 event pairs, 4831 based on Foata normal form. 317/22461 useless extension candidates. Maximal degree in co-relation 89713. Up to 10139 conditions per place. [2025-03-14 00:54:33,551 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 62 selfloop transitions, 7 changer transitions 69/142 dead transitions. [2025-03-14 00:54:33,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 142 transitions, 1850 flow [2025-03-14 00:54:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:54:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:54:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-03-14 00:54:33,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2025-03-14 00:54:33,553 INFO L175 Difference]: Start difference. First operand has 96 places, 61 transitions, 826 flow. Second operand 7 states and 147 transitions. [2025-03-14 00:54:33,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 142 transitions, 1850 flow [2025-03-14 00:54:34,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 142 transitions, 1736 flow, removed 41 selfloop flow, removed 7 redundant places. [2025-03-14 00:54:34,073 INFO L231 Difference]: Finished difference. Result has 94 places, 56 transitions, 706 flow [2025-03-14 00:54:34,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=706, PETRI_PLACES=94, PETRI_TRANSITIONS=56} [2025-03-14 00:54:34,073 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2025-03-14 00:54:34,073 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 56 transitions, 706 flow [2025-03-14 00:54:34,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:34,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:34,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:34,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:54:34,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:34,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1745178861, now seen corresponding path program 1 times [2025-03-14 00:54:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:34,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718213597] [2025-03-14 00:54:34,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:34,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:54:34,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:54:34,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:34,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:34,150 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-14 00:54:34,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718213597] [2025-03-14 00:54:34,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718213597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:34,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:34,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:54:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874725922] [2025-03-14 00:54:34,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:34,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:34,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:34,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:34,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-14 00:54:34,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 56 transitions, 706 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:34,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:34,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-14 00:54:34,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:35,355 INFO L124 PetriNetUnfolderBase]: 9996/15913 cut-off events. [2025-03-14 00:54:35,355 INFO L125 PetriNetUnfolderBase]: For 111227/111233 co-relation queries the response was YES. [2025-03-14 00:54:35,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56346 conditions, 15913 events. 9996/15913 cut-off events. For 111227/111233 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 108634 event pairs, 1840 based on Foata normal form. 833/16739 useless extension candidates. Maximal degree in co-relation 56310. Up to 8089 conditions per place. [2025-03-14 00:54:35,426 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 102 selfloop transitions, 5 changer transitions 13/125 dead transitions. [2025-03-14 00:54:35,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 125 transitions, 1930 flow [2025-03-14 00:54:35,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:54:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:54:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-14 00:54:35,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6447368421052632 [2025-03-14 00:54:35,427 INFO L175 Difference]: Start difference. First operand has 94 places, 56 transitions, 706 flow. Second operand 4 states and 98 transitions. [2025-03-14 00:54:35,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 125 transitions, 1930 flow [2025-03-14 00:54:35,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 125 transitions, 1724 flow, removed 22 selfloop flow, removed 12 redundant places. [2025-03-14 00:54:35,580 INFO L231 Difference]: Finished difference. Result has 83 places, 59 transitions, 644 flow [2025-03-14 00:54:35,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=644, PETRI_PLACES=83, PETRI_TRANSITIONS=59} [2025-03-14 00:54:35,580 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2025-03-14 00:54:35,580 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 59 transitions, 644 flow [2025-03-14 00:54:35,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:35,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:35,580 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] [2025-03-14 00:54:35,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:54:35,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:35,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1661889172, now seen corresponding path program 1 times [2025-03-14 00:54:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704630317] [2025-03-14 00:54:35,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:35,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 00:54:35,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:54:35,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:35,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:35,667 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-14 00:54:35,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704630317] [2025-03-14 00:54:35,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704630317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:35,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:35,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:35,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185645256] [2025-03-14 00:54:35,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:35,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:35,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:35,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:35,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:35,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-14 00:54:35,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 59 transitions, 644 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-14 00:54:35,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:35,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-14 00:54:35,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:36,364 INFO L124 PetriNetUnfolderBase]: 6239/9832 cut-off events. [2025-03-14 00:54:36,365 INFO L125 PetriNetUnfolderBase]: For 46824/46830 co-relation queries the response was YES. [2025-03-14 00:54:36,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34323 conditions, 9832 events. 6239/9832 cut-off events. For 46824/46830 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 60813 event pairs, 777 based on Foata normal form. 657/10482 useless extension candidates. Maximal degree in co-relation 34294. Up to 3090 conditions per place. [2025-03-14 00:54:36,407 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 72 selfloop transitions, 8 changer transitions 46/131 dead transitions. [2025-03-14 00:54:36,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 131 transitions, 1727 flow [2025-03-14 00:54:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:54:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:54:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-14 00:54:36,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2025-03-14 00:54:36,408 INFO L175 Difference]: Start difference. First operand has 83 places, 59 transitions, 644 flow. Second operand 5 states and 125 transitions. [2025-03-14 00:54:36,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 131 transitions, 1727 flow [2025-03-14 00:54:36,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 131 transitions, 1655 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-03-14 00:54:36,452 INFO L231 Difference]: Finished difference. Result has 84 places, 50 transitions, 514 flow [2025-03-14 00:54:36,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=514, PETRI_PLACES=84, PETRI_TRANSITIONS=50} [2025-03-14 00:54:36,453 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2025-03-14 00:54:36,453 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 50 transitions, 514 flow [2025-03-14 00:54:36,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-14 00:54:36,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:36,453 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] [2025-03-14 00:54:36,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:54:36,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:36,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:36,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1166627137, now seen corresponding path program 1 times [2025-03-14 00:54:36,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:36,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589381891] [2025-03-14 00:54:36,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:36,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:36,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:54:36,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:54:36,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:36,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:36,531 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-14 00:54:36,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:36,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589381891] [2025-03-14 00:54:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589381891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:36,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:36,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:36,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389966887] [2025-03-14 00:54:36,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:36,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:36,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:36,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:36,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:36,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-14 00:54:36,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 50 transitions, 514 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-14 00:54:36,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:36,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-14 00:54:36,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:36,717 INFO L124 PetriNetUnfolderBase]: 1537/2443 cut-off events. [2025-03-14 00:54:36,717 INFO L125 PetriNetUnfolderBase]: For 14044/14046 co-relation queries the response was YES. [2025-03-14 00:54:36,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9407 conditions, 2443 events. 1537/2443 cut-off events. For 14044/14046 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11805 event pairs, 237 based on Foata normal form. 120/2561 useless extension candidates. Maximal degree in co-relation 9380. Up to 876 conditions per place. [2025-03-14 00:54:36,723 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 0 selfloop transitions, 0 changer transitions 89/89 dead transitions. [2025-03-14 00:54:36,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 1102 flow [2025-03-14 00:54:36,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:54:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:54:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2025-03-14 00:54:36,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-03-14 00:54:36,724 INFO L175 Difference]: Start difference. First operand has 84 places, 50 transitions, 514 flow. Second operand 6 states and 124 transitions. [2025-03-14 00:54:36,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 1102 flow [2025-03-14 00:54:36,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 89 transitions, 881 flow, removed 4 selfloop flow, removed 14 redundant places. [2025-03-14 00:54:36,736 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2025-03-14 00:54:36,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=71, PETRI_TRANSITIONS=0} [2025-03-14 00:54:36,736 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2025-03-14 00:54:36,737 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2025-03-14 00:54:36,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-14 00:54:36,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 00:54:36,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 00:54:36,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 00:54:36,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 00:54:36,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:54:36,740 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:36,742 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:54:36,742 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:54:36,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:54:36 BasicIcfg [2025-03-14 00:54:36,745 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:54:36,746 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:54:36,746 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:54:36,746 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:54:36,746 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:23" (3/4) ... [2025-03-14 00:54:36,747 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:54:36,749 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-14 00:54:36,749 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-14 00:54:36,749 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-14 00:54:36,752 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-03-14 00:54:36,753 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-14 00:54:36,753 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:54:36,753 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:54:36,804 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:54:36,804 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:54:36,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:54:36,805 INFO L158 Benchmark]: Toolchain (without parser) took 13723.19ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 110.7MB in the beginning and 789.5MB in the end (delta: -678.8MB). Peak memory consumption was 684.4MB. Max. memory is 16.1GB. [2025-03-14 00:54:36,805 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:54:36,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.23ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 90.6MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:54:36,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.03ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:54:36,806 INFO L158 Benchmark]: Boogie Preprocessor took 21.87ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:54:36,806 INFO L158 Benchmark]: IcfgBuilder took 338.24ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 66.4MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:54:36,806 INFO L158 Benchmark]: TraceAbstraction took 12956.17ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 65.9MB in the beginning and 797.9MB in the end (delta: -732.0MB). Peak memory consumption was 634.1MB. Max. memory is 16.1GB. [2025-03-14 00:54:36,806 INFO L158 Benchmark]: Witness Printer took 58.85ms. Allocated memory is still 1.5GB. Free memory was 797.9MB in the beginning and 789.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:54:36,807 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.68ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.23ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 90.6MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.03ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.87ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 338.24ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 66.4MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12956.17ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 65.9MB in the beginning and 797.9MB in the end (delta: -732.0MB). Peak memory consumption was 634.1MB. Max. memory is 16.1GB. * Witness Printer took 58.85ms. Allocated memory is still 1.5GB. Free memory was 797.9MB in the beginning and 789.5MB in the end (delta: 8.4MB). 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, 62 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: 12.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 836 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1922 IncrementalHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 9 mSDtfsCounter, 1922 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=826occurred in iteration=6, InterpolantAutomatonStates: 79, 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, 1.3s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-14 00:54:36,820 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