./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/29_conditionals_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/29_conditionals_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 c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:45:15,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:45:15,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:45:15,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:45:15,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:45:15,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:45:15,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:45:15,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:45:15,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:45:15,613 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:45:15,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:45:15,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:45:15,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:45:15,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:45:15,614 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:45:15,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:45:15,614 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:45:15,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:45:15,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:45:15,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:45:15,614 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:45:15,614 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:45:15,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:45:15,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:45:15,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:45:15,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:45:15,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:45:15,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:45:15,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:45:15,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:45:15,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:45:15,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:45:15,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:45:15,616 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 -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 [2025-03-04 09:45:15,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:45:15,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:45:15,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:45:15,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:45:15,873 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:45:15,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-03-04 09:45:17,022 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d7843f7/3bd601860d6449fdb262d1c7721d153b/FLAGf30b8f68e [2025-03-04 09:45:17,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:45:17,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-03-04 09:45:17,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d7843f7/3bd601860d6449fdb262d1c7721d153b/FLAGf30b8f68e [2025-03-04 09:45:17,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d7843f7/3bd601860d6449fdb262d1c7721d153b [2025-03-04 09:45:17,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:45:17,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:45:17,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:45:17,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:45:17,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:45:17,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bfe655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17, skipping insertion in model container [2025-03-04 09:45:17,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:45:17,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:45:17,847 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:45:17,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:45:17,901 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:45:17,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17 WrapperNode [2025-03-04 09:45:17,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:45:17,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:45:17,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:45:17,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:45:17,910 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:45:17" (1/1) ... [2025-03-04 09:45:17,917 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:45:17" (1/1) ... [2025-03-04 09:45:17,927 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 57 [2025-03-04 09:45:17,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:45:17,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:45:17,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:45:17,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:45:17,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,946 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:45:17,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:45:17,956 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:45:17,956 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:45:17,960 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:45:17,961 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (1/1) ... [2025-03-04 09:45:17,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:45:17,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:45:17,985 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:45:17,987 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:45:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 09:45:18,003 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 09:45:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:45:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:45:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:45:18,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:45:18,004 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:45:18,075 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:45:18,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:45:18,165 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:45:18,165 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:45:18,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:45:18,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:45:18,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:45:18 BoogieIcfgContainer [2025-03-04 09:45:18,239 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:45:18,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:45:18,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:45:18,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:45:18,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:45:17" (1/3) ... [2025-03-04 09:45:18,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103a4328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:45:18, skipping insertion in model container [2025-03-04 09:45:18,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:17" (2/3) ... [2025-03-04 09:45:18,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103a4328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:45:18, skipping insertion in model container [2025-03-04 09:45:18,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:45:18" (3/3) ... [2025-03-04 09:45:18,247 INFO L128 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2025-03-04 09:45:18,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:45:18,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 29_conditionals_vs.i that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-04 09:45:18,260 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:45:18,296 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:18,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 25 transitions, 54 flow [2025-03-04 09:45:18,338 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-03-04 09:45:18,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:18,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 29 events. 4/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 22. Up to 3 conditions per place. [2025-03-04 09:45:18,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 25 transitions, 54 flow [2025-03-04 09:45:18,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 25 transitions, 54 flow [2025-03-04 09:45:18,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:18,358 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;@1656c45e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:18,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 09:45:18,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:18,360 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:45:18,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:18,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:18,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:45:18,361 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:45:18,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:18,366 INFO L85 PathProgramCache]: Analyzing trace with hash 164139, now seen corresponding path program 1 times [2025-03-04 09:45:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:18,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220368049] [2025-03-04 09:45:18,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:18,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:45:18,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:45:18,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:18,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:18,453 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:45:18,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:18,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220368049] [2025-03-04 09:45:18,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220368049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:18,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:18,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:18,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577896427] [2025-03-04 09:45:18,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:18,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:18,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:18,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:18,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:18,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 25 [2025-03-04 09:45:18,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 25 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:45:18,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:18,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 25 [2025-03-04 09:45:18,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:18,514 INFO L124 PetriNetUnfolderBase]: 16/59 cut-off events. [2025-03-04 09:45:18,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:18,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 59 events. 16/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 159 event pairs, 10 based on Foata normal form. 6/56 useless extension candidates. Maximal degree in co-relation 81. Up to 31 conditions per place. [2025-03-04 09:45:18,516 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 9 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2025-03-04 09:45:18,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 60 flow [2025-03-04 09:45:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2025-03-04 09:45:18,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-04 09:45:18,524 INFO L175 Difference]: Start difference. First operand has 24 places, 25 transitions, 54 flow. Second operand 2 states and 34 transitions. [2025-03-04 09:45:18,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 60 flow [2025-03-04 09:45:18,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 60 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:18,529 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 42 flow [2025-03-04 09:45:18,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-03-04 09:45:18,534 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, -3 predicate places. [2025-03-04 09:45:18,534 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 42 flow [2025-03-04 09:45:18,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:45:18,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:18,534 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 09:45:18,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:45:18,535 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:45:18,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash 596669599, now seen corresponding path program 1 times [2025-03-04 09:45:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:18,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30101907] [2025-03-04 09:45:18,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:18,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:45:18,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:45:18,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:18,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:18,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:45:18,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:45:18,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:45:18,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:18,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:18,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:45:18,588 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:45:18,589 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-04 09:45:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-04 09:45:18,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-03-04 09:45:18,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-03-04 09:45:18,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:45:18,592 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 09:45:18,597 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:45:18,597 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:45:18,614 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:18,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 43 transitions, 96 flow [2025-03-04 09:45:18,628 INFO L124 PetriNetUnfolderBase]: 8/52 cut-off events. [2025-03-04 09:45:18,628 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:45:18,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 52 events. 8/52 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 39. Up to 3 conditions per place. [2025-03-04 09:45:18,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 43 transitions, 96 flow [2025-03-04 09:45:18,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 43 transitions, 96 flow [2025-03-04 09:45:18,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:18,631 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;@1656c45e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:18,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 09:45:18,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:18,632 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:45:18,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:18,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:18,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:45:18,632 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:45:18,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash 206838, now seen corresponding path program 1 times [2025-03-04 09:45:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899682854] [2025-03-04 09:45:18,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:18,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:45:18,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:45:18,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:18,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:18,651 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:45:18,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:18,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899682854] [2025-03-04 09:45:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899682854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:18,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:18,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456287716] [2025-03-04 09:45:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:18,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:18,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:18,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:18,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-03-04 09:45:18,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 43 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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:45:18,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:18,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-03-04 09:45:18,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:18,757 INFO L124 PetriNetUnfolderBase]: 202/480 cut-off events. [2025-03-04 09:45:18,757 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 09:45:18,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 480 events. 202/480 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2423 event pairs, 160 based on Foata normal form. 54/462 useless extension candidates. Maximal degree in co-relation 432. Up to 289 conditions per place. [2025-03-04 09:45:18,764 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 15 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2025-03-04 09:45:18,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 108 flow [2025-03-04 09:45:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2025-03-04 09:45:18,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-03-04 09:45:18,766 INFO L175 Difference]: Start difference. First operand has 40 places, 43 transitions, 96 flow. Second operand 2 states and 60 transitions. [2025-03-04 09:45:18,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 108 flow [2025-03-04 09:45:18,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:18,768 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 78 flow [2025-03-04 09:45:18,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-04 09:45:18,769 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-03-04 09:45:18,769 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 78 flow [2025-03-04 09:45:18,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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:45:18,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:18,769 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-04 09:45:18,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:45:18,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:45:18,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1281910436, now seen corresponding path program 1 times [2025-03-04 09:45:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:18,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899037431] [2025-03-04 09:45:18,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:18,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:18,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:45:18,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:45:18,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:18,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:18,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:45:18,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:45:18,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:45:18,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:18,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:18,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:45:18,793 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:45:18,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 09:45:18,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-04 09:45:18,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-03-04 09:45:18,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-03-04 09:45:18,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-04 09:45:18,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:45:18,793 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 09:45:18,794 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:45:18,794 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 09:45:18,810 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:18,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 61 transitions, 140 flow [2025-03-04 09:45:18,821 INFO L124 PetriNetUnfolderBase]: 12/75 cut-off events. [2025-03-04 09:45:18,821 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 09:45:18,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 75 events. 12/75 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 224 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 59. Up to 4 conditions per place. [2025-03-04 09:45:18,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 61 transitions, 140 flow [2025-03-04 09:45:18,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 61 transitions, 140 flow [2025-03-04 09:45:18,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:18,823 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;@1656c45e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:18,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 09:45:18,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:18,824 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:45:18,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:18,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:18,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:45:18,825 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:45:18,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash 267411, now seen corresponding path program 1 times [2025-03-04 09:45:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969310139] [2025-03-04 09:45:18,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:18,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:45:18,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:45:18,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:18,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:18,847 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:45:18,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:18,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969310139] [2025-03-04 09:45:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969310139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:18,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:18,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:18,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108735024] [2025-03-04 09:45:18,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:18,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:18,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:18,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:18,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 61 [2025-03-04 09:45:18,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 140 flow. Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:45:18,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:18,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 61 [2025-03-04 09:45:18,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:19,131 INFO L124 PetriNetUnfolderBase]: 1852/3525 cut-off events. [2025-03-04 09:45:19,132 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-03-04 09:45:19,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6070 conditions, 3525 events. 1852/3525 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 23579 event pairs, 1600 based on Foata normal form. 528/3609 useless extension candidates. Maximal degree in co-relation 981. Up to 2377 conditions per place. [2025-03-04 09:45:19,153 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 21 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2025-03-04 09:45:19,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 158 flow [2025-03-04 09:45:19,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2025-03-04 09:45:19,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7049180327868853 [2025-03-04 09:45:19,155 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 140 flow. Second operand 2 states and 86 transitions. [2025-03-04 09:45:19,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 158 flow [2025-03-04 09:45:19,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 156 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:19,156 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 114 flow [2025-03-04 09:45:19,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2025-03-04 09:45:19,157 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2025-03-04 09:45:19,157 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 114 flow [2025-03-04 09:45:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:45:19,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:19,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:19,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:45:19,157 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:45:19,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash -370421994, now seen corresponding path program 1 times [2025-03-04 09:45:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40045740] [2025-03-04 09:45:19,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:19,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:45:19,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:45:19,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:19,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:19,259 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:45:19,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40045740] [2025-03-04 09:45:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40045740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:19,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:45:19,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654403257] [2025-03-04 09:45:19,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:19,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:45:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:19,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:45:19,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:45:19,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2025-03-04 09:45:19,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:45:19,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:19,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2025-03-04 09:45:19,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:19,693 INFO L124 PetriNetUnfolderBase]: 3454/5970 cut-off events. [2025-03-04 09:45:19,694 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-04 09:45:19,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11108 conditions, 5970 events. 3454/5970 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 40763 event pairs, 736 based on Foata normal form. 0/5619 useless extension candidates. Maximal degree in co-relation 11102. Up to 2085 conditions per place. [2025-03-04 09:45:19,725 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 52 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-03-04 09:45:19,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 302 flow [2025-03-04 09:45:19,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:45:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:45:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-03-04 09:45:19,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2025-03-04 09:45:19,727 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 114 flow. Second operand 4 states and 152 transitions. [2025-03-04 09:45:19,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 302 flow [2025-03-04 09:45:19,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:19,729 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 118 flow [2025-03-04 09:45:19,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-03-04 09:45:19,730 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-03-04 09:45:19,730 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 118 flow [2025-03-04 09:45:19,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:45:19,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:19,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:19,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:45:19,730 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:45:19,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash -369438891, now seen corresponding path program 1 times [2025-03-04 09:45:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:19,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47894700] [2025-03-04 09:45:19,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:19,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:45:19,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:45:19,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:19,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:19,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:19,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47894700] [2025-03-04 09:45:19,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47894700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:19,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:19,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:45:19,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958838450] [2025-03-04 09:45:19,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:19,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:45:19,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:19,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:45:19,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:45:19,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 09:45:19,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:45:19,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:19,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 09:45:19,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:20,178 INFO L124 PetriNetUnfolderBase]: 3454/5454 cut-off events. [2025-03-04 09:45:20,178 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2025-03-04 09:45:20,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10851 conditions, 5454 events. 3454/5454 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 32973 event pairs, 736 based on Foata normal form. 129/5340 useless extension candidates. Maximal degree in co-relation 10844. Up to 2085 conditions per place. [2025-03-04 09:45:20,204 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 53 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-03-04 09:45:20,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 298 flow [2025-03-04 09:45:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:45:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:45:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-03-04 09:45:20,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6065573770491803 [2025-03-04 09:45:20,205 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 118 flow. Second operand 4 states and 148 transitions. [2025-03-04 09:45:20,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 298 flow [2025-03-04 09:45:20,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:45:20,207 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 109 flow [2025-03-04 09:45:20,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-03-04 09:45:20,208 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2025-03-04 09:45:20,208 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 109 flow [2025-03-04 09:45:20,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:45:20,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:20,208 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-04 09:45:20,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:45:20,210 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:45:20,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1280644898, now seen corresponding path program 1 times [2025-03-04 09:45:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:20,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905063608] [2025-03-04 09:45:20,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:20,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:20,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:45:20,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:45:20,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:20,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:20,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:45:20,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:45:20,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:45:20,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:20,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:20,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:45:20,234 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:45:20,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 09:45:20,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-04 09:45:20,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-04 09:45:20,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-03-04 09:45:20,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-03-04 09:45:20,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-04 09:45:20,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:45:20,234 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 09:45:20,235 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:45:20,235 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 09:45:20,263 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:20,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 79 transitions, 186 flow [2025-03-04 09:45:20,270 INFO L124 PetriNetUnfolderBase]: 16/98 cut-off events. [2025-03-04 09:45:20,270 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:45:20,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 98 events. 16/98 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 309 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 87. Up to 5 conditions per place. [2025-03-04 09:45:20,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 79 transitions, 186 flow [2025-03-04 09:45:20,271 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 79 transitions, 186 flow [2025-03-04 09:45:20,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:20,273 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;@1656c45e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:20,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:45:20,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:20,274 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:45:20,274 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:20,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:20,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:45:20,276 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:45:20,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash 345858, now seen corresponding path program 1 times [2025-03-04 09:45:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484407876] [2025-03-04 09:45:20,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:20,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:45:20,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:45:20,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:20,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:20,288 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:45:20,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:20,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484407876] [2025-03-04 09:45:20,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484407876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:20,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:20,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114915798] [2025-03-04 09:45:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:20,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:20,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:20,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:20,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 79 [2025-03-04 09:45:20,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 186 flow. Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 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:45:20,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:20,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 79 [2025-03-04 09:45:20,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:21,676 INFO L124 PetriNetUnfolderBase]: 14992/25038 cut-off events. [2025-03-04 09:45:21,676 INFO L125 PetriNetUnfolderBase]: For 2861/2861 co-relation queries the response was YES. [2025-03-04 09:45:21,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44432 conditions, 25038 events. 14992/25038 cut-off events. For 2861/2861 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 196484 event pairs, 13480 based on Foata normal form. 4682/27047 useless extension candidates. Maximal degree in co-relation 6108. Up to 18145 conditions per place. [2025-03-04 09:45:21,807 INFO L140 encePairwiseOnDemand]: 70/79 looper letters, 27 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2025-03-04 09:45:21,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 210 flow [2025-03-04 09:45:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2025-03-04 09:45:21,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7088607594936709 [2025-03-04 09:45:21,809 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 186 flow. Second operand 2 states and 112 transitions. [2025-03-04 09:45:21,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 210 flow [2025-03-04 09:45:21,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 204 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:21,812 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 150 flow [2025-03-04 09:45:21,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=150, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2025-03-04 09:45:21,812 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-03-04 09:45:21,813 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 150 flow [2025-03-04 09:45:21,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 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:45:21,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:21,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:45:21,813 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:45:21,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:21,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1289793942, now seen corresponding path program 1 times [2025-03-04 09:45:21,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:21,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010133482] [2025-03-04 09:45:21,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:21,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:21,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:45:21,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:45:21,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:21,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:21,855 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:45:21,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:21,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010133482] [2025-03-04 09:45:21,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010133482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:21,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:21,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:45:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861500731] [2025-03-04 09:45:21,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:21,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:45:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:21,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:45:21,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:45:21,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 79 [2025-03-04 09:45:21,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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:45:21,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:21,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 79 [2025-03-04 09:45:21,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:23,961 INFO L124 PetriNetUnfolderBase]: 28492/43617 cut-off events. [2025-03-04 09:45:23,961 INFO L125 PetriNetUnfolderBase]: For 1790/1790 co-relation queries the response was YES. [2025-03-04 09:45:24,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82236 conditions, 43617 events. 28492/43617 cut-off events. For 1790/1790 co-relation queries the response was YES. Maximal size of possible extension queue 1720. Compared 335728 event pairs, 6352 based on Foata normal form. 0/41465 useless extension candidates. Maximal degree in co-relation 82229. Up to 15765 conditions per place. [2025-03-04 09:45:24,191 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 70 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2025-03-04 09:45:24,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 408 flow [2025-03-04 09:45:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:45:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:45:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2025-03-04 09:45:24,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518987341772152 [2025-03-04 09:45:24,193 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 150 flow. Second operand 4 states and 206 transitions. [2025-03-04 09:45:24,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 408 flow [2025-03-04 09:45:24,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 105 transitions, 408 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:24,196 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 154 flow [2025-03-04 09:45:24,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-03-04 09:45:24,198 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2025-03-04 09:45:24,198 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 154 flow [2025-03-04 09:45:24,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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:45:24,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:24,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:24,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:45:24,199 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:45:24,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1290777045, now seen corresponding path program 1 times [2025-03-04 09:45:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568925783] [2025-03-04 09:45:24,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:24,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:45:24,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:45:24,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:24,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:24,249 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:45:24,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:24,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568925783] [2025-03-04 09:45:24,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568925783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:24,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:24,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:45:24,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260805398] [2025-03-04 09:45:24,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:24,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:45:24,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:24,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:45:24,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:45:24,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 79 [2025-03-04 09:45:24,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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:45:24,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:24,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 79 [2025-03-04 09:45:24,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:25,817 INFO L124 PetriNetUnfolderBase]: 28492/40509 cut-off events. [2025-03-04 09:45:25,817 INFO L125 PetriNetUnfolderBase]: For 2564/2564 co-relation queries the response was YES. [2025-03-04 09:45:25,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80683 conditions, 40509 events. 28492/40509 cut-off events. For 2564/2564 co-relation queries the response was YES. Maximal size of possible extension queue 1489. Compared 273324 event pairs, 6352 based on Foata normal form. 777/39785 useless extension candidates. Maximal degree in co-relation 80675. Up to 15765 conditions per place. [2025-03-04 09:45:26,028 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 71 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-04 09:45:26,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 404 flow [2025-03-04 09:45:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:45:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:45:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2025-03-04 09:45:26,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6392405063291139 [2025-03-04 09:45:26,030 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 154 flow. Second operand 4 states and 202 transitions. [2025-03-04 09:45:26,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 404 flow [2025-03-04 09:45:26,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:45:26,040 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 145 flow [2025-03-04 09:45:26,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-03-04 09:45:26,041 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-03-04 09:45:26,041 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 145 flow [2025-03-04 09:45:26,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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:45:26,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:26,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:26,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:45:26,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:45:26,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1972322805, now seen corresponding path program 1 times [2025-03-04 09:45:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:26,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612859801] [2025-03-04 09:45:26,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:26,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:45:26,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:45:26,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:26,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:26,076 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:45:26,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:26,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612859801] [2025-03-04 09:45:26,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612859801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:26,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:26,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:45:26,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62118140] [2025-03-04 09:45:26,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:26,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:45:26,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:26,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:45:26,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:45:26,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 79 [2025-03-04 09:45:26,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:45:26,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:26,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 79 [2025-03-04 09:45:26,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:28,713 INFO L124 PetriNetUnfolderBase]: 38482/58644 cut-off events. [2025-03-04 09:45:28,714 INFO L125 PetriNetUnfolderBase]: For 3974/3974 co-relation queries the response was YES. [2025-03-04 09:45:28,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112141 conditions, 58644 events. 38482/58644 cut-off events. For 3974/3974 co-relation queries the response was YES. Maximal size of possible extension queue 2439. Compared 466930 event pairs, 8611 based on Foata normal form. 0/54282 useless extension candidates. Maximal degree in co-relation 112133. Up to 21195 conditions per place. [2025-03-04 09:45:28,996 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 68 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2025-03-04 09:45:28,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 389 flow [2025-03-04 09:45:28,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:45:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:45:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2025-03-04 09:45:28,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6455696202531646 [2025-03-04 09:45:28,997 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 145 flow. Second operand 4 states and 204 transitions. [2025-03-04 09:45:28,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 389 flow [2025-03-04 09:45:29,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:45:29,003 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 146 flow [2025-03-04 09:45:29,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2025-03-04 09:45:29,004 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2025-03-04 09:45:29,004 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 146 flow [2025-03-04 09:45:29,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:45:29,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:29,004 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:29,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:45:29,004 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:45:29,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1971339702, now seen corresponding path program 1 times [2025-03-04 09:45:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:29,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325804118] [2025-03-04 09:45:29,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:29,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:45:29,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:45:29,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:29,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:29,045 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:45:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325804118] [2025-03-04 09:45:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325804118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:45:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052915594] [2025-03-04 09:45:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:29,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:45:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:29,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:45:29,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:45:29,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 79 [2025-03-04 09:45:29,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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:45:29,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:29,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 79 [2025-03-04 09:45:29,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:31,555 INFO L124 PetriNetUnfolderBase]: 38482/54516 cut-off events. [2025-03-04 09:45:31,555 INFO L125 PetriNetUnfolderBase]: For 3440/3440 co-relation queries the response was YES. [2025-03-04 09:45:31,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108526 conditions, 54516 events. 38482/54516 cut-off events. For 3440/3440 co-relation queries the response was YES. Maximal size of possible extension queue 2132. Compared 381172 event pairs, 8611 based on Foata normal form. 1032/52044 useless extension candidates. Maximal degree in co-relation 108518. Up to 21195 conditions per place. [2025-03-04 09:45:31,825 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 69 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-03-04 09:45:31,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 378 flow [2025-03-04 09:45:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:45:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:45:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-03-04 09:45:31,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6329113924050633 [2025-03-04 09:45:31,826 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 146 flow. Second operand 4 states and 200 transitions. [2025-03-04 09:45:31,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 378 flow [2025-03-04 09:45:31,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:45:31,835 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 137 flow [2025-03-04 09:45:31,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-03-04 09:45:31,835 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2025-03-04 09:45:31,835 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 137 flow [2025-03-04 09:45:31,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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:45:31,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:31,836 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:31,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:45:31,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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:45:31,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 477479721, now seen corresponding path program 1 times [2025-03-04 09:45:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:31,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300247814] [2025-03-04 09:45:31,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:31,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:45:31,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:45:31,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:31,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:31,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:45:31,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:45:31,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:45:31,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:31,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:31,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:45:31,850 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:45:31,850 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-04 09:45:31,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 09:45:31,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-04 09:45:31,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-03-04 09:45:31,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-04 09:45:31,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-04 09:45:31,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 09:45:31,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:45:31,851 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 09:45:31,851 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:45:31,851 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 09:45:31,872 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:31,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 97 transitions, 234 flow [2025-03-04 09:45:31,877 INFO L124 PetriNetUnfolderBase]: 20/121 cut-off events. [2025-03-04 09:45:31,878 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 09:45:31,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 121 events. 20/121 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 403 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 116. Up to 6 conditions per place. [2025-03-04 09:45:31,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 97 transitions, 234 flow [2025-03-04 09:45:31,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 97 transitions, 234 flow [2025-03-04 09:45:31,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:31,880 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;@1656c45e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:31,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 09:45:31,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:31,880 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:45:31,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:31,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:31,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:45:31,880 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:45:31,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash 442179, now seen corresponding path program 1 times [2025-03-04 09:45:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041898204] [2025-03-04 09:45:31,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:31,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:31,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:45:31,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:45:31,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:31,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:31,886 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:45:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:31,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041898204] [2025-03-04 09:45:31,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041898204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:31,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:31,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:31,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432066550] [2025-03-04 09:45:31,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:31,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:31,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:31,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:31,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:31,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 09:45:31,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 97 transitions, 234 flow. Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 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:45:31,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:31,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 09:45:31,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:40,667 INFO L124 PetriNetUnfolderBase]: 113272/173556 cut-off events. [2025-03-04 09:45:40,667 INFO L125 PetriNetUnfolderBase]: For 26711/26711 co-relation queries the response was YES. [2025-03-04 09:45:41,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314775 conditions, 173556 events. 113272/173556 cut-off events. For 26711/26711 co-relation queries the response was YES. Maximal size of possible extension queue 6117. Compared 1519273 event pairs, 104200 based on Foata normal form. 37383/194892 useless extension candidates. Maximal degree in co-relation 44685. Up to 132193 conditions per place. [2025-03-04 09:45:42,010 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 33 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2025-03-04 09:45:42,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 264 flow [2025-03-04 09:45:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2025-03-04 09:45:42,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.711340206185567 [2025-03-04 09:45:42,011 INFO L175 Difference]: Start difference. First operand has 88 places, 97 transitions, 234 flow. Second operand 2 states and 138 transitions. [2025-03-04 09:45:42,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 264 flow [2025-03-04 09:45:42,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 252 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:42,023 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 186 flow [2025-03-04 09:45:42,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=186, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2025-03-04 09:45:42,024 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -7 predicate places. [2025-03-04 09:45:42,024 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 186 flow [2025-03-04 09:45:42,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 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:45:42,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:42,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:42,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:45:42,024 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:45:42,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash -650715160, now seen corresponding path program 1 times [2025-03-04 09:45:42,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011364072] [2025-03-04 09:45:42,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:42,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:45:42,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:45:42,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:42,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:42,055 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:45:42,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:42,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011364072] [2025-03-04 09:45:42,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011364072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:42,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:42,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:45:42,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113333950] [2025-03-04 09:45:42,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:42,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:45:42,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:42,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:45:42,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:45:42,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 97 [2025-03-04 09:45:42,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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:45:42,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:42,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 97 [2025-03-04 09:45:42,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand