./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:46:03,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:46:03,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:46:03,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:46:03,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:46:03,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:46:03,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:46:03,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:46:03,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:46:03,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:46:03,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:46:03,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:46:03,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:46:03,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:46:03,262 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:46:03,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:46:03,262 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:46:03,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:46:03,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:46:03,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:46:03,262 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:46:03,262 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:46:03,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:46:03,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:46:03,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:46:03,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:46:03,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:46:03,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:46:03,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:46:03,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:46:03,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:46:03,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:46:03,264 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2025-03-04 09:46:03,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:46:03,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:46:03,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:46:03,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:46:03,478 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:46:03,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-04 09:46:04,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e047523e/6902e00aea79460f9b1a8f036bd4fc3e/FLAG3252d9a8e [2025-03-04 09:46:04,806 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:46:04,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-04 09:46:04,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e047523e/6902e00aea79460f9b1a8f036bd4fc3e/FLAG3252d9a8e [2025-03-04 09:46:05,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e047523e/6902e00aea79460f9b1a8f036bd4fc3e [2025-03-04 09:46:05,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:46:05,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:46:05,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:46:05,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:46:05,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:46:05,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05, skipping insertion in model container [2025-03-04 09:46:05,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:46:05,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:46:05,355 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:46:05,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:46:05,412 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:46:05,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05 WrapperNode [2025-03-04 09:46:05,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:46:05,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:46:05,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:46:05,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:46:05,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,437 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-03-04 09:46:05,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:46:05,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:46:05,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:46:05,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:46:05,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,452 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-04 09:46:05,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:46:05,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:46:05,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:46:05,465 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:46:05,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (1/1) ... [2025-03-04 09:46:05,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:46:05,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:46:05,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:46:05,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:46:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 09:46:05,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 09:46:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:46:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:46:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:46:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:46:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:46:05,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:46:05,506 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:46:05,574 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:46:05,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:46:05,637 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:46:05,638 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:46:05,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:46:05,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:46:05,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:46:05 BoogieIcfgContainer [2025-03-04 09:46:05,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:46:05,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:46:05,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:46:05,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:46:05,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:46:05" (1/3) ... [2025-03-04 09:46:05,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175f3a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:46:05, skipping insertion in model container [2025-03-04 09:46:05,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:46:05" (2/3) ... [2025-03-04 09:46:05,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175f3a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:46:05, skipping insertion in model container [2025-03-04 09:46:05,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:46:05" (3/3) ... [2025-03-04 09:46:05,687 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-03-04 09:46:05,696 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:46:05,698 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 12 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-04 09:46:05,698 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:46:05,731 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:46:05,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 12 transitions, 28 flow [2025-03-04 09:46:05,785 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-04 09:46:05,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:46:05,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 28 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 09:46:05,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 12 transitions, 28 flow [2025-03-04 09:46:05,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 12 transitions, 28 flow [2025-03-04 09:46:05,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:46:05,808 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=None, 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;@7bf9cb25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:46:05,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 09:46:05,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:46:05,811 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:46:05,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:46:05,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:05,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:46:05,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:46:05,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:05,817 INFO L85 PathProgramCache]: Analyzing trace with hash 115353, now seen corresponding path program 1 times [2025-03-04 09:46:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:05,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915315800] [2025-03-04 09:46:05,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:05,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:46:05,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:46:05,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:05,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:05,922 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-04 09:46:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915315800] [2025-03-04 09:46:05,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915315800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:05,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:05,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:05,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830912713] [2025-03-04 09:46:05,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:05,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:46:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:05,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:46:05,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:46:05,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 12 [2025-03-04 09:46:05,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 28 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:05,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:05,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 12 [2025-03-04 09:46:05,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:05,985 INFO L124 PetriNetUnfolderBase]: 5/20 cut-off events. [2025-03-04 09:46:05,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:46:05,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 20 events. 5/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 5 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 32. Up to 20 conditions per place. [2025-03-04 09:46:05,989 INFO L140 encePairwiseOnDemand]: 11/12 looper letters, 8 selfloop transitions, 0 changer transitions 0/9 dead transitions. [2025-03-04 09:46:05,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 9 transitions, 38 flow [2025-03-04 09:46:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:46:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:46:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2025-03-04 09:46:06,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-04 09:46:06,003 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 28 flow. Second operand 2 states and 13 transitions. [2025-03-04 09:46:06,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 9 transitions, 38 flow [2025-03-04 09:46:06,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 9 transitions, 38 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:06,006 INFO L231 Difference]: Finished difference. Result has 13 places, 9 transitions, 22 flow [2025-03-04 09:46:06,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=22, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=22, PETRI_PLACES=13, PETRI_TRANSITIONS=9} [2025-03-04 09:46:06,012 INFO L279 CegarLoopForPetriNet]: 15 programPoint places, -2 predicate places. [2025-03-04 09:46:06,013 INFO L471 AbstractCegarLoop]: Abstraction has has 13 places, 9 transitions, 22 flow [2025-03-04 09:46:06,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:06,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:06,014 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 09:46:06,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:46:06,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:46:06,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash 110894666, now seen corresponding path program 1 times [2025-03-04 09:46:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-03-04 09:46:06,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:06,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:46:06,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:46:06,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:06,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:46:06,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:46:06,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:46:06,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:46:06,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:06,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:46:06,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:46:06,073 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:46:06,074 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-04 09:46:06,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-04 09:46:06,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-03-04 09:46:06,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-03-04 09:46:06,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:46:06,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 09:46:06,079 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:46:06,079 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:46:06,099 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:46:06,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2025-03-04 09:46:06,109 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-04 09:46:06,109 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:46:06,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 26 events. 0/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-03-04 09:46:06,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2025-03-04 09:46:06,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2025-03-04 09:46:06,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:46:06,111 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=None, 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;@7bf9cb25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:46:06,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 09:46:06,112 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:46:06,112 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:46:06,113 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:46:06,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:06,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:46:06,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:46:06,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash 133227, now seen corresponding path program 1 times [2025-03-04 09:46:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:06,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285407539] [2025-03-04 09:46:06,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:06,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:46:06,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:46:06,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:06,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:06,133 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-04 09:46:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285407539] [2025-03-04 09:46:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285407539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:06,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604451004] [2025-03-04 09:46:06,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:06,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:46:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:06,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:46:06,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:46:06,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2025-03-04 09:46:06,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:06,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:06,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2025-03-04 09:46:06,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:06,190 INFO L124 PetriNetUnfolderBase]: 95/183 cut-off events. [2025-03-04 09:46:06,190 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 09:46:06,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 183 events. 95/183 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 587 event pairs, 95 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 256. Up to 182 conditions per place. [2025-03-04 09:46:06,192 INFO L140 encePairwiseOnDemand]: 17/18 looper letters, 14 selfloop transitions, 0 changer transitions 0/15 dead transitions. [2025-03-04 09:46:06,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 68 flow [2025-03-04 09:46:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:46:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:46:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 19 transitions. [2025-03-04 09:46:06,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-03-04 09:46:06,193 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 2 states and 19 transitions. [2025-03-04 09:46:06,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 68 flow [2025-03-04 09:46:06,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 15 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:06,194 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 40 flow [2025-03-04 09:46:06,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2025-03-04 09:46:06,194 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, -2 predicate places. [2025-03-04 09:46:06,194 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 15 transitions, 40 flow [2025-03-04 09:46:06,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:06,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:06,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:46:06,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:46:06,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:46:06,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash -324571742, now seen corresponding path program 1 times [2025-03-04 09:46:06,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:06,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097622560] [2025-03-04 09:46:06,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:06,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:06,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:46:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:46:06,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:06,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:06,244 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-04 09:46:06,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:06,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097622560] [2025-03-04 09:46:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097622560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984348338] [2025-03-04 09:46:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:06,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:46:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:06,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:46:06,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:46:06,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2025-03-04 09:46:06,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 15 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04 09:46:06,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:06,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2025-03-04 09:46:06,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:06,319 INFO L124 PetriNetUnfolderBase]: 109/215 cut-off events. [2025-03-04 09:46:06,319 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 09:46:06,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 215 events. 109/215 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 796 event pairs, 45 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 445. Up to 116 conditions per place. [2025-03-04 09:46:06,322 INFO L140 encePairwiseOnDemand]: 14/18 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-03-04 09:46:06,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 109 flow [2025-03-04 09:46:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:46:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:46:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-03-04 09:46:06,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 09:46:06,324 INFO L175 Difference]: Start difference. First operand has 21 places, 15 transitions, 40 flow. Second operand 3 states and 30 transitions. [2025-03-04 09:46:06,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 109 flow [2025-03-04 09:46:06,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:06,326 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 62 flow [2025-03-04 09:46:06,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2025-03-04 09:46:06,327 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-03-04 09:46:06,327 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 62 flow [2025-03-04 09:46:06,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04 09:46:06,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:06,327 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-03-04 09:46:06,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:46:06,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:46:06,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:06,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1472081801, now seen corresponding path program 1 times [2025-03-04 09:46:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:06,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110321968] [2025-03-04 09:46:06,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:06,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:06,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:46:06,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:46:06,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:06,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:46:06,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:46:06,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:46:06,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:46:06,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:06,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:46:06,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:46:06,356 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:46:06,356 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 09:46:06,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-04 09:46:06,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-03-04 09:46:06,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-03-04 09:46:06,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-04 09:46:06,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:46:06,356 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 09:46:06,357 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:46:06,357 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 09:46:06,374 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:46:06,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 66 flow [2025-03-04 09:46:06,400 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-03-04 09:46:06,400 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 09:46:06,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 0/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-03-04 09:46:06,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 24 transitions, 66 flow [2025-03-04 09:46:06,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 66 flow [2025-03-04 09:46:06,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:46:06,401 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=None, 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;@7bf9cb25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:46:06,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 09:46:06,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:46:06,402 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:46:06,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:46:06,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:06,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:46:06,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:46:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash 157059, now seen corresponding path program 1 times [2025-03-04 09:46:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:06,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385000432] [2025-03-04 09:46:06,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:06,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:46:06,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:46:06,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:06,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:06,422 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-04 09:46:06,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:06,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385000432] [2025-03-04 09:46:06,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385000432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:06,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:06,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:06,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192471879] [2025-03-04 09:46:06,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:06,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:46:06,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:06,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:46:06,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:46:06,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2025-03-04 09:46:06,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:06,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:06,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2025-03-04 09:46:06,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:06,576 INFO L124 PetriNetUnfolderBase]: 995/1523 cut-off events. [2025-03-04 09:46:06,577 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-03-04 09:46:06,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 1523 events. 995/1523 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6367 event pairs, 995 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 632. Up to 1514 conditions per place. [2025-03-04 09:46:06,589 INFO L140 encePairwiseOnDemand]: 23/24 looper letters, 20 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-03-04 09:46:06,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 100 flow [2025-03-04 09:46:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:46:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:46:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2025-03-04 09:46:06,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-04 09:46:06,592 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 2 states and 25 transitions. [2025-03-04 09:46:06,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 100 flow [2025-03-04 09:46:06,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 98 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:06,593 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 58 flow [2025-03-04 09:46:06,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2025-03-04 09:46:06,593 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2025-03-04 09:46:06,593 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 58 flow [2025-03-04 09:46:06,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:06,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:06,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:46:06,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:46:06,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:46:06,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 385580157, now seen corresponding path program 1 times [2025-03-04 09:46:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:06,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149074294] [2025-03-04 09:46:06,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:06,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:06,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:46:06,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:46:06,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:06,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:06,634 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-04 09:46:06,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:06,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149074294] [2025-03-04 09:46:06,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149074294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:06,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:06,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493470203] [2025-03-04 09:46:06,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:06,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:46:06,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:06,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:46:06,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:46:06,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2025-03-04 09:46:06,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04 09:46:06,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:06,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2025-03-04 09:46:06,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:06,826 INFO L124 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2025-03-04 09:46:06,826 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-04 09:46:06,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 2070 events. 1343/2070 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10044 event pairs, 681 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 4288. Up to 1272 conditions per place. [2025-03-04 09:46:06,841 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2025-03-04 09:46:06,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 168 flow [2025-03-04 09:46:06,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:46:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:46:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-03-04 09:46:06,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 09:46:06,844 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 58 flow. Second operand 3 states and 42 transitions. [2025-03-04 09:46:06,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 168 flow [2025-03-04 09:46:06,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:06,845 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 88 flow [2025-03-04 09:46:06,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2025-03-04 09:46:06,846 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-03-04 09:46:06,846 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 88 flow [2025-03-04 09:46:06,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04 09:46:06,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:06,846 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:46:06,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:46:06,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:46:06,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1166443596, now seen corresponding path program 1 times [2025-03-04 09:46:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:06,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209054996] [2025-03-04 09:46:06,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:06,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:46:06,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:46:06,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:06,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:46:06,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:06,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209054996] [2025-03-04 09:46:06,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209054996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:06,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:06,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:06,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707054667] [2025-03-04 09:46:06,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:06,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:46:06,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:06,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:46:06,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:46:06,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2025-03-04 09:46:06,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04 09:46:06,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:06,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2025-03-04 09:46:06,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:07,098 INFO L124 PetriNetUnfolderBase]: 1689/2637 cut-off events. [2025-03-04 09:46:07,099 INFO L125 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2025-03-04 09:46:07,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6319 conditions, 2637 events. 1689/2637 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13550 event pairs, 787 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 6311. Up to 1546 conditions per place. [2025-03-04 09:46:07,111 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2025-03-04 09:46:07,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 221 flow [2025-03-04 09:46:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:46:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:46:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-03-04 09:46:07,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-03-04 09:46:07,113 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 88 flow. Second operand 3 states and 41 transitions. [2025-03-04 09:46:07,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 221 flow [2025-03-04 09:46:07,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:46:07,123 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 128 flow [2025-03-04 09:46:07,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2025-03-04 09:46:07,124 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2025-03-04 09:46:07,124 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 128 flow [2025-03-04 09:46:07,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04 09:46:07,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:07,124 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-03-04 09:46:07,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:46:07,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:46:07,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:07,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1799572597, now seen corresponding path program 1 times [2025-03-04 09:46:07,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:07,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488957145] [2025-03-04 09:46:07,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:07,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:46:07,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:46:07,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:07,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:46:07,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:46:07,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:46:07,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:46:07,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:07,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:46:07,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:46:07,147 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:46:07,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 09:46:07,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-04 09:46:07,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-04 09:46:07,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-03-04 09:46:07,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-03-04 09:46:07,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-04 09:46:07,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:46:07,148 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 09:46:07,148 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:46:07,148 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 09:46:07,168 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:46:07,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 88 flow [2025-03-04 09:46:07,172 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-03-04 09:46:07,172 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:46:07,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 46 events. 0/46 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 112 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-03-04 09:46:07,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 30 transitions, 88 flow [2025-03-04 09:46:07,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 88 flow [2025-03-04 09:46:07,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:46:07,173 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=None, 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;@7bf9cb25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:46:07,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:46:07,174 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:46:07,174 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:46:07,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:46:07,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:07,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:46:07,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:46:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash 186849, now seen corresponding path program 1 times [2025-03-04 09:46:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951930223] [2025-03-04 09:46:07,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:07,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:46:07,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:46:07,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:07,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:07,181 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-04 09:46:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951930223] [2025-03-04 09:46:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951930223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:07,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:07,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286336800] [2025-03-04 09:46:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:07,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:46:07,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:07,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:46:07,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:46:07,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-03-04 09:46:07,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:07,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:07,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-03-04 09:46:07,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:07,814 INFO L124 PetriNetUnfolderBase]: 8555/11725 cut-off events. [2025-03-04 09:46:07,814 INFO L125 PetriNetUnfolderBase]: For 2706/2706 co-relation queries the response was YES. [2025-03-04 09:46:07,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24640 conditions, 11725 events. 8555/11725 cut-off events. For 2706/2706 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 56159 event pairs, 8555 based on Foata normal form. 0/9755 useless extension candidates. Maximal degree in co-relation 3241. Up to 11666 conditions per place. [2025-03-04 09:46:07,893 INFO L140 encePairwiseOnDemand]: 29/30 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-03-04 09:46:07,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 134 flow [2025-03-04 09:46:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:46:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:46:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2025-03-04 09:46:07,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-04 09:46:07,895 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 88 flow. Second operand 2 states and 31 transitions. [2025-03-04 09:46:07,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 134 flow [2025-03-04 09:46:07,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 128 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:07,899 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 76 flow [2025-03-04 09:46:07,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-03-04 09:46:07,900 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-03-04 09:46:07,900 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 76 flow [2025-03-04 09:46:07,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:07,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:07,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:46:07,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:46:07,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:46:07,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1273237757, now seen corresponding path program 1 times [2025-03-04 09:46:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:07,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125504600] [2025-03-04 09:46:07,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:07,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:07,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:46:07,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:46:07,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:07,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:07,925 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-04 09:46:07,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125504600] [2025-03-04 09:46:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125504600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:07,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:07,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139903192] [2025-03-04 09:46:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:07,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:46:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:07,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:46:07,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:46:07,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-03-04 09:46:07,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04 09:46:07,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:07,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-03-04 09:46:07,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:08,777 INFO L124 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2025-03-04 09:46:08,778 INFO L125 PetriNetUnfolderBase]: For 1375/1375 co-relation queries the response was YES. [2025-03-04 09:46:08,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34713 conditions, 16840 events. 12243/16840 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90038 event pairs, 6745 based on Foata normal form. 0/14174 useless extension candidates. Maximal degree in co-relation 34706. Up to 10936 conditions per place. [2025-03-04 09:46:08,857 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-03-04 09:46:08,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 227 flow [2025-03-04 09:46:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:46:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:46:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-04 09:46:08,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 09:46:08,860 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 76 flow. Second operand 3 states and 54 transitions. [2025-03-04 09:46:08,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 227 flow [2025-03-04 09:46:08,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:08,866 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 114 flow [2025-03-04 09:46:08,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-03-04 09:46:08,867 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-03-04 09:46:08,868 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 114 flow [2025-03-04 09:46:08,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04 09:46:08,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:08,869 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:46:08,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:46:08,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:46:08,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -497711193, now seen corresponding path program 1 times [2025-03-04 09:46:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:08,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122127697] [2025-03-04 09:46:08,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:08,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:08,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:46:08,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:46:08,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:08,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:08,895 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-04 09:46:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:08,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122127697] [2025-03-04 09:46:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122127697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:08,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:08,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116214797] [2025-03-04 09:46:08,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:08,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:46:08,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:08,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:46:08,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:46:08,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-03-04 09:46:08,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04 09:46:08,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:08,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-03-04 09:46:08,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:09,885 INFO L124 PetriNetUnfolderBase]: 16953/23450 cut-off events. [2025-03-04 09:46:09,886 INFO L125 PetriNetUnfolderBase]: For 9851/9851 co-relation queries the response was YES. [2025-03-04 09:46:09,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55877 conditions, 23450 events. 16953/23450 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 133452 event pairs, 8455 based on Foata normal form. 0/20680 useless extension candidates. Maximal degree in co-relation 55868. Up to 15062 conditions per place. [2025-03-04 09:46:10,000 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 45 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-03-04 09:46:10,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 300 flow [2025-03-04 09:46:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:46:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:46:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-04 09:46:10,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-04 09:46:10,001 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 114 flow. Second operand 3 states and 53 transitions. [2025-03-04 09:46:10,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 300 flow [2025-03-04 09:46:10,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:46:10,041 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 172 flow [2025-03-04 09:46:10,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-03-04 09:46:10,042 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2025-03-04 09:46:10,042 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 172 flow [2025-03-04 09:46:10,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04 09:46:10,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:10,042 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:46:10,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:46:10,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:46:10,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1577359396, now seen corresponding path program 1 times [2025-03-04 09:46:10,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:10,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859435569] [2025-03-04 09:46:10,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:10,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:46:10,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:46:10,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:10,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:10,069 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-04 09:46:10,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:10,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859435569] [2025-03-04 09:46:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859435569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:10,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:10,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425169016] [2025-03-04 09:46:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:10,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:46:10,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:10,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:46:10,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:46:10,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-03-04 09:46:10,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-04 09:46:10,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:10,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-03-04 09:46:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:11,437 INFO L124 PetriNetUnfolderBase]: 22305/31049 cut-off events. [2025-03-04 09:46:11,438 INFO L125 PetriNetUnfolderBase]: For 20707/20707 co-relation queries the response was YES. [2025-03-04 09:46:11,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79821 conditions, 31049 events. 22305/31049 cut-off events. For 20707/20707 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 185200 event pairs, 10801 based on Foata normal form. 0/27827 useless extension candidates. Maximal degree in co-relation 79811. Up to 19502 conditions per place. [2025-03-04 09:46:11,620 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 49 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2025-03-04 09:46:11,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 409 flow [2025-03-04 09:46:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:46:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:46:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-04 09:46:11,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-03-04 09:46:11,623 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 172 flow. Second operand 3 states and 52 transitions. [2025-03-04 09:46:11,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 409 flow [2025-03-04 09:46:11,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:46:11,685 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 278 flow [2025-03-04 09:46:11,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-03-04 09:46:11,686 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2025-03-04 09:46:11,686 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 278 flow [2025-03-04 09:46:11,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-04 09:46:11,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:11,687 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:46:11,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:46:11,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:46:11,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1896316743, now seen corresponding path program 1 times [2025-03-04 09:46:11,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:11,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269144330] [2025-03-04 09:46:11,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:11,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:46:11,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:46:11,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:11,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:11,763 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-04 09:46:11,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:11,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269144330] [2025-03-04 09:46:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269144330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:11,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:46:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336477705] [2025-03-04 09:46:11,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:11,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:46:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:11,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:46:11,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:46:11,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-03-04 09:46:11,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-04 09:46:11,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:11,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-03-04 09:46:11,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:14,211 INFO L124 PetriNetUnfolderBase]: 38199/53543 cut-off events. [2025-03-04 09:46:14,211 INFO L125 PetriNetUnfolderBase]: For 51743/51743 co-relation queries the response was YES. [2025-03-04 09:46:14,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150160 conditions, 53543 events. 38199/53543 cut-off events. For 51743/51743 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 356730 event pairs, 6385 based on Foata normal form. 0/48341 useless extension candidates. Maximal degree in co-relation 150149. Up to 16776 conditions per place. [2025-03-04 09:46:14,476 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 113 selfloop transitions, 33 changer transitions 0/147 dead transitions. [2025-03-04 09:46:14,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 147 transitions, 1084 flow [2025-03-04 09:46:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:46:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:46:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-03-04 09:46:14,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 09:46:14,478 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 278 flow. Second operand 6 states and 120 transitions. [2025-03-04 09:46:14,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 147 transitions, 1084 flow [2025-03-04 09:46:14,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 147 transitions, 1016 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:46:14,622 INFO L231 Difference]: Finished difference. Result has 52 places, 70 transitions, 575 flow [2025-03-04 09:46:14,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=52, PETRI_TRANSITIONS=70} [2025-03-04 09:46:14,622 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2025-03-04 09:46:14,622 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 70 transitions, 575 flow [2025-03-04 09:46:14,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-04 09:46:14,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:14,622 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:46:14,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:46:14,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:46:14,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1559265213, now seen corresponding path program 2 times [2025-03-04 09:46:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:14,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989028493] [2025-03-04 09:46:14,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:46:14,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:14,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:46:14,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:46:14,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:46:14,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:14,675 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-04 09:46:14,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:14,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989028493] [2025-03-04 09:46:14,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989028493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:14,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:14,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:46:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30189171] [2025-03-04 09:46:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:14,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:46:14,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:14,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:46:14,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:46:14,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-03-04 09:46:14,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 70 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-04 09:46:14,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:14,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-03-04 09:46:14,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:17,884 INFO L124 PetriNetUnfolderBase]: 41715/58936 cut-off events. [2025-03-04 09:46:17,884 INFO L125 PetriNetUnfolderBase]: For 95225/95225 co-relation queries the response was YES. [2025-03-04 09:46:18,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183312 conditions, 58936 events. 41715/58936 cut-off events. For 95225/95225 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 404891 event pairs, 5243 based on Foata normal form. 740/55052 useless extension candidates. Maximal degree in co-relation 183297. Up to 19534 conditions per place. [2025-03-04 09:46:18,215 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 128 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2025-03-04 09:46:18,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 179 transitions, 1515 flow [2025-03-04 09:46:18,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:46:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:46:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-04 09:46:18,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-04 09:46:18,216 INFO L175 Difference]: Start difference. First operand has 52 places, 70 transitions, 575 flow. Second operand 7 states and 135 transitions. [2025-03-04 09:46:18,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 179 transitions, 1515 flow [2025-03-04 09:46:18,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:18,463 INFO L231 Difference]: Finished difference. Result has 62 places, 95 transitions, 1039 flow [2025-03-04 09:46:18,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=62, PETRI_TRANSITIONS=95} [2025-03-04 09:46:18,463 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2025-03-04 09:46:18,463 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 95 transitions, 1039 flow [2025-03-04 09:46:18,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-04 09:46:18,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:18,464 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-03-04 09:46:18,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:46:18,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:46:18,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1653627900, now seen corresponding path program 1 times [2025-03-04 09:46:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313408396] [2025-03-04 09:46:18,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:18,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:46:18,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:46:18,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:18,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:46:18,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:46:18,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:46:18,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:46:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:46:18,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:46:18,475 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:46:18,475 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-04 09:46:18,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 09:46:18,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-04 09:46:18,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-03-04 09:46:18,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-04 09:46:18,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-04 09:46:18,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 09:46:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:46:18,476 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-03-04 09:46:18,476 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:46:18,476 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 09:46:18,493 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:46:18,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 112 flow [2025-03-04 09:46:18,498 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-03-04 09:46:18,499 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 09:46:18,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 56 events. 0/56 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 152 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-03-04 09:46:18,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 36 transitions, 112 flow [2025-03-04 09:46:18,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 36 transitions, 112 flow [2025-03-04 09:46:18,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:46:18,502 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=None, 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;@7bf9cb25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:46:18,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 09:46:18,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:46:18,503 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:46:18,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:46:18,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:18,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:46:18,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 09:46:18,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:18,503 INFO L85 PathProgramCache]: Analyzing trace with hash 222597, now seen corresponding path program 1 times [2025-03-04 09:46:18,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:18,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767116382] [2025-03-04 09:46:18,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:18,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:18,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:46:18,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:46:18,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:18,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:18,511 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-04 09:46:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767116382] [2025-03-04 09:46:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767116382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:18,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:18,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406560860] [2025-03-04 09:46:18,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:18,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:46:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:18,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:46:18,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:46:18,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-03-04 09:46:18,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:18,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:18,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-03-04 09:46:18,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:21,923 INFO L124 PetriNetUnfolderBase]: 66875/85897 cut-off events. [2025-03-04 09:46:21,923 INFO L125 PetriNetUnfolderBase]: For 25086/25086 co-relation queries the response was YES. [2025-03-04 09:46:22,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180461 conditions, 85897 events. 66875/85897 cut-off events. For 25086/25086 co-relation queries the response was YES. Maximal size of possible extension queue 2281. Compared 444735 event pairs, 66875 based on Foata normal form. 0/70967 useless extension candidates. Maximal degree in co-relation 24891. Up to 85538 conditions per place. [2025-03-04 09:46:22,363 INFO L140 encePairwiseOnDemand]: 35/36 looper letters, 32 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2025-03-04 09:46:22,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 170 flow [2025-03-04 09:46:22,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:46:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:46:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2025-03-04 09:46:22,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-03-04 09:46:22,364 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 112 flow. Second operand 2 states and 37 transitions. [2025-03-04 09:46:22,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 170 flow [2025-03-04 09:46:22,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 33 transitions, 158 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:22,370 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 94 flow [2025-03-04 09:46:22,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2025-03-04 09:46:22,370 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-03-04 09:46:22,370 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 94 flow [2025-03-04 09:46:22,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04 09:46:22,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:22,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:46:22,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:46:22,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 09:46:22,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1956581133, now seen corresponding path program 1 times [2025-03-04 09:46:22,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875192268] [2025-03-04 09:46:22,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:22,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:46:22,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:46:22,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:22,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:22,390 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-04 09:46:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875192268] [2025-03-04 09:46:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875192268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:22,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124233364] [2025-03-04 09:46:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:22,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:46:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:22,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:46:22,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:46:22,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-03-04 09:46:22,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04 09:46:22,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:22,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-03-04 09:46:22,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:27,082 INFO L124 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2025-03-04 09:46:27,082 INFO L125 PetriNetUnfolderBase]: For 11167/11167 co-relation queries the response was YES. [2025-03-04 09:46:27,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258461 conditions, 126043 events. 97851/126043 cut-off events. For 11167/11167 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 716327 event pairs, 56393 based on Foata normal form. 0/105265 useless extension candidates. Maximal degree in co-relation 258453. Up to 84136 conditions per place. [2025-03-04 09:46:27,776 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-03-04 09:46:27,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 286 flow [2025-03-04 09:46:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:46:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:46:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-04 09:46:27,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-04 09:46:27,778 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 94 flow. Second operand 3 states and 66 transitions. [2025-03-04 09:46:27,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 286 flow [2025-03-04 09:46:27,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:46:27,789 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 140 flow [2025-03-04 09:46:27,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2025-03-04 09:46:27,790 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-03-04 09:46:27,790 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 140 flow [2025-03-04 09:46:27,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04 09:46:27,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:46:27,790 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:46:27,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:46:27,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 09:46:27,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:46:27,791 INFO L85 PathProgramCache]: Analyzing trace with hash 912597102, now seen corresponding path program 1 times [2025-03-04 09:46:27,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:46:27,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557536075] [2025-03-04 09:46:27,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:46:27,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:46:27,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:46:27,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:46:27,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:46:27,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:46:27,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-04 09:46:27,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:46:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557536075] [2025-03-04 09:46:27,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557536075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:46:27,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:46:27,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:46:27,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729027045] [2025-03-04 09:46:27,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:46:27,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:46:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:46:27,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:46:27,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:46:27,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-03-04 09:46:27,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04 09:46:27,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:46:27,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-03-04 09:46:27,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:46:35,617 INFO L124 PetriNetUnfolderBase]: 140281/181269 cut-off events. [2025-03-04 09:46:35,617 INFO L125 PetriNetUnfolderBase]: For 76649/76649 co-relation queries the response was YES. [2025-03-04 09:46:36,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429057 conditions, 181269 events. 140281/181269 cut-off events. For 76649/76649 co-relation queries the response was YES. Maximal size of possible extension queue 5212. Compared 1084017 event pairs, 73535 based on Foata normal form. 0/157427 useless extension candidates. Maximal degree in co-relation 429047. Up to 121118 conditions per place. [2025-03-04 09:46:36,732 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 57 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2025-03-04 09:46:36,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 379 flow [2025-03-04 09:46:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:46:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:46:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-04 09:46:36,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2025-03-04 09:46:36,733 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 140 flow. Second operand 3 states and 65 transitions. [2025-03-04 09:46:36,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 379 flow