./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 00:57:53,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:57:53,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:57:53,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:57:53,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:57:53,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:57:53,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:57:53,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:57:53,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:57:53,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:57:53,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:57:53,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:57:53,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:57:53,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:57:53,665 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:57:53,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:57:53,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:57:53,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:57:53,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:57:53,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:57:53,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:57:53,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:57:53,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:57:53,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:57:53,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:57:53,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:57:53,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:57:53,667 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-09 00:57:53,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:57:53,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:57:53,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:57:53,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:57:53,950 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:57:53,950 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-09 00:57:55,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f85c6b2e/e832a2ee13234c1e91a55ab6e379508e/FLAG25fa35ee4 [2025-03-09 00:57:55,414 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:57:55,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-03-09 00:57:55,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f85c6b2e/e832a2ee13234c1e91a55ab6e379508e/FLAG25fa35ee4 [2025-03-09 00:57:55,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f85c6b2e/e832a2ee13234c1e91a55ab6e379508e [2025-03-09 00:57:55,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:57:55,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:57:55,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:57:55,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:57:55,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:57:55,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:57:55" (1/1) ... [2025-03-09 00:57:55,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee025a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:55, skipping insertion in model container [2025-03-09 00:57:55,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:57:55" (1/1) ... [2025-03-09 00:57:55,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:57:55,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:57:55,995 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:57:56,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:57:56,047 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:57:56,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56 WrapperNode [2025-03-09 00:57:56,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:57:56,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:57:56,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:57:56,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:57:56,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,069 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 57 [2025-03-09 00:57:56,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:57:56,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:57:56,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:57:56,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:57:56,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,088 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-09 00:57:56,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:57:56,095 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:57:56,095 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:57:56,095 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:57:56,096 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (1/1) ... [2025-03-09 00:57:56,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:57:56,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:56,119 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-09 00:57:56,121 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-09 00:57:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-09 00:57:56,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-09 00:57:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:57:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:57:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:57:56,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:57:56,139 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:57:56,231 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:57:56,233 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:57:56,347 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:57:56,349 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:57:56,409 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:57:56,409 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:57:56,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:57:56 BoogieIcfgContainer [2025-03-09 00:57:56,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:57:56,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:57:56,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:57:56,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:57:56,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:57:55" (1/3) ... [2025-03-09 00:57:56,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59922131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:57:56, skipping insertion in model container [2025-03-09 00:57:56,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:56" (2/3) ... [2025-03-09 00:57:56,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59922131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:57:56, skipping insertion in model container [2025-03-09 00:57:56,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:57:56" (3/3) ... [2025-03-09 00:57:56,417 INFO L128 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2025-03-09 00:57:56,428 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:57:56,429 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-09 00:57:56,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:57:56,471 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:56,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 25 transitions, 54 flow [2025-03-09 00:57:56,512 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-03-09 00:57:56,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:56,515 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-09 00:57:56,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 25 transitions, 54 flow [2025-03-09 00:57:56,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 25 transitions, 54 flow [2025-03-09 00:57:56,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:56,534 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;@66ba1e41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:56,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 00:57:56,538 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:56,538 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-09 00:57:56,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:56,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:56,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:56,539 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-09 00:57:56,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash 164139, now seen corresponding path program 1 times [2025-03-09 00:57:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072982746] [2025-03-09 00:57:56,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:56,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:56,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:56,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:56,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:56,639 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-09 00:57:56,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:56,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072982746] [2025-03-09 00:57:56,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072982746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:56,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:56,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:57:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490237045] [2025-03-09 00:57:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:56,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:57:56,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:56,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:57:56,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:57:56,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 25 [2025-03-09 00:57:56,671 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-09 00:57:56,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:56,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 25 [2025-03-09 00:57:56,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:56,714 INFO L124 PetriNetUnfolderBase]: 16/59 cut-off events. [2025-03-09 00:57:56,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:56,716 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-09 00:57:56,717 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 9 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2025-03-09 00:57:56,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 60 flow [2025-03-09 00:57:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:57:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:57:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2025-03-09 00:57:56,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-09 00:57:56,728 INFO L175 Difference]: Start difference. First operand has 24 places, 25 transitions, 54 flow. Second operand 2 states and 34 transitions. [2025-03-09 00:57:56,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 60 flow [2025-03-09 00:57:56,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 60 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:56,734 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 42 flow [2025-03-09 00:57:56,736 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-09 00:57:56,740 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, -3 predicate places. [2025-03-09 00:57:56,740 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 42 flow [2025-03-09 00:57:56,740 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-09 00:57:56,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:56,740 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 00:57:56,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:57:56,741 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-09 00:57:56,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:56,741 INFO L85 PathProgramCache]: Analyzing trace with hash 596669599, now seen corresponding path program 1 times [2025-03-09 00:57:56,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:56,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463481958] [2025-03-09 00:57:56,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:56,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:56,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:57:56,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:57:56,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:56,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:56,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:56,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:57:56,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:57:56,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:56,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:56,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:56,782 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:56,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-09 00:57:56,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-09 00:57:56,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-03-09 00:57:56,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-03-09 00:57:56,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:57:56,787 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 00:57:56,789 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:57:56,789 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 00:57:56,810 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:56,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 43 transitions, 96 flow [2025-03-09 00:57:56,826 INFO L124 PetriNetUnfolderBase]: 8/52 cut-off events. [2025-03-09 00:57:56,826 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:57:56,827 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-09 00:57:56,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 43 transitions, 96 flow [2025-03-09 00:57:56,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 43 transitions, 96 flow [2025-03-09 00:57:56,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:56,829 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;@66ba1e41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:56,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-09 00:57:56,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:56,830 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-09 00:57:56,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:56,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:56,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:56,830 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-09 00:57:56,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash 206838, now seen corresponding path program 1 times [2025-03-09 00:57:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:56,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596322170] [2025-03-09 00:57:56,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:56,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:56,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:56,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:56,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:56,844 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-09 00:57:56,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596322170] [2025-03-09 00:57:56,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596322170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:56,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:57:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762390966] [2025-03-09 00:57:56,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:56,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:57:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:56,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:57:56,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:57:56,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-03-09 00:57:56,845 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-09 00:57:56,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:56,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-03-09 00:57:56,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:56,942 INFO L124 PetriNetUnfolderBase]: 202/480 cut-off events. [2025-03-09 00:57:56,942 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 00:57:56,944 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-09 00:57:56,946 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 15 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2025-03-09 00:57:56,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 108 flow [2025-03-09 00:57:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:57:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:57:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2025-03-09 00:57:56,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-03-09 00:57:56,947 INFO L175 Difference]: Start difference. First operand has 40 places, 43 transitions, 96 flow. Second operand 2 states and 60 transitions. [2025-03-09 00:57:56,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 108 flow [2025-03-09 00:57:56,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:56,948 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 78 flow [2025-03-09 00:57:56,948 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-09 00:57:56,949 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-03-09 00:57:56,949 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 78 flow [2025-03-09 00:57:56,949 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-09 00:57:56,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:56,949 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-09 00:57:56,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:57:56,949 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-09 00:57:56,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1281910436, now seen corresponding path program 1 times [2025-03-09 00:57:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:56,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331458842] [2025-03-09 00:57:56,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:56,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:57:56,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:57:56,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:56,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:56,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:56,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:57:56,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:57:56,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:56,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:56,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:56,985 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:56,985 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-09 00:57:56,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-09 00:57:56,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-03-09 00:57:56,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-03-09 00:57:56,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-09 00:57:56,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:57:56,986 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 00:57:56,999 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:57:56,999 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 00:57:57,020 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:57,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 61 transitions, 140 flow [2025-03-09 00:57:57,031 INFO L124 PetriNetUnfolderBase]: 12/75 cut-off events. [2025-03-09 00:57:57,031 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 00:57:57,032 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-09 00:57:57,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 61 transitions, 140 flow [2025-03-09 00:57:57,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 61 transitions, 140 flow [2025-03-09 00:57:57,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:57,034 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;@66ba1e41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:57,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 00:57:57,034 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:57,034 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-09 00:57:57,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:57,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:57,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:57,035 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-09 00:57:57,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:57,035 INFO L85 PathProgramCache]: Analyzing trace with hash 267411, now seen corresponding path program 1 times [2025-03-09 00:57:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:57,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460859282] [2025-03-09 00:57:57,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:57,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:57,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:57,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:57,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:57,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:57,057 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-09 00:57:57,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:57,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460859282] [2025-03-09 00:57:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460859282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:57,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:57,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:57:57,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081901083] [2025-03-09 00:57:57,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:57,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:57:57,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:57,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:57:57,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:57:57,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 61 [2025-03-09 00:57:57,058 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-09 00:57:57,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:57,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 61 [2025-03-09 00:57:57,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:57,349 INFO L124 PetriNetUnfolderBase]: 1852/3525 cut-off events. [2025-03-09 00:57:57,350 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-03-09 00:57:57,358 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-09 00:57:57,371 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 21 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2025-03-09 00:57:57,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 158 flow [2025-03-09 00:57:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:57:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:57:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2025-03-09 00:57:57,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7049180327868853 [2025-03-09 00:57:57,372 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 140 flow. Second operand 2 states and 86 transitions. [2025-03-09 00:57:57,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 158 flow [2025-03-09 00:57:57,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 156 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:57,374 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 114 flow [2025-03-09 00:57:57,374 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-09 00:57:57,374 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2025-03-09 00:57:57,374 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 114 flow [2025-03-09 00:57:57,374 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-09 00:57:57,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:57,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:57,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:57:57,375 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-09 00:57:57,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:57,375 INFO L85 PathProgramCache]: Analyzing trace with hash -370421994, now seen corresponding path program 1 times [2025-03-09 00:57:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:57,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019853418] [2025-03-09 00:57:57,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:57,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:57,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:57:57,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:57,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:57,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:57,484 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-09 00:57:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019853418] [2025-03-09 00:57:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019853418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:57,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:57,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:57:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145528317] [2025-03-09 00:57:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:57,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:57:57,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:57,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:57:57,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:57:57,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2025-03-09 00:57:57,494 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-09 00:57:57,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:57,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2025-03-09 00:57:57,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:57,961 INFO L124 PetriNetUnfolderBase]: 3454/5970 cut-off events. [2025-03-09 00:57:57,961 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-09 00:57:57,973 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-09 00:57:57,999 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 52 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-03-09 00:57:57,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 302 flow [2025-03-09 00:57:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:57:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:57:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-03-09 00:57:58,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2025-03-09 00:57:58,001 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 114 flow. Second operand 4 states and 152 transitions. [2025-03-09 00:57:58,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 302 flow [2025-03-09 00:57:58,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:58,003 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 118 flow [2025-03-09 00:57:58,003 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-09 00:57:58,006 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-03-09 00:57:58,006 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 118 flow [2025-03-09 00:57:58,006 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-09 00:57:58,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:58,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:58,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:57:58,006 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-09 00:57:58,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash -369438891, now seen corresponding path program 1 times [2025-03-09 00:57:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:58,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980395083] [2025-03-09 00:57:58,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:58,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:58,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:57:58,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:58,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:58,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:58,050 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-09 00:57:58,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:58,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980395083] [2025-03-09 00:57:58,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980395083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:58,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:57:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306026442] [2025-03-09 00:57:58,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:58,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:57:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:58,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:57:58,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:57:58,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-09 00:57:58,060 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-09 00:57:58,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:58,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-09 00:57:58,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:58,456 INFO L124 PetriNetUnfolderBase]: 3454/5454 cut-off events. [2025-03-09 00:57:58,456 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2025-03-09 00:57:58,468 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-09 00:57:58,489 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 53 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-03-09 00:57:58,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 298 flow [2025-03-09 00:57:58,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:57:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:57:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-03-09 00:57:58,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6065573770491803 [2025-03-09 00:57:58,493 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 118 flow. Second operand 4 states and 148 transitions. [2025-03-09 00:57:58,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 298 flow [2025-03-09 00:57:58,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:57:58,497 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 109 flow [2025-03-09 00:57:58,497 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-09 00:57:58,498 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2025-03-09 00:57:58,498 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 109 flow [2025-03-09 00:57:58,498 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-09 00:57:58,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:58,498 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-09 00:57:58,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:57:58,499 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-09 00:57:58,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1280644898, now seen corresponding path program 1 times [2025-03-09 00:57:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:58,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776384817] [2025-03-09 00:57:58,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:58,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:58,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:57:58,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:57:58,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:58,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:58,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:57:58,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:57:58,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:58,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:58,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:58,528 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:58,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-09 00:57:58,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-09 00:57:58,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-09 00:57:58,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-03-09 00:57:58,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-03-09 00:57:58,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-09 00:57:58,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:57:58,529 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 00:57:58,530 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:57:58,530 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 00:57:58,555 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:58,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 79 transitions, 186 flow [2025-03-09 00:57:58,563 INFO L124 PetriNetUnfolderBase]: 16/98 cut-off events. [2025-03-09 00:57:58,563 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 00:57:58,564 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-09 00:57:58,564 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 79 transitions, 186 flow [2025-03-09 00:57:58,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 79 transitions, 186 flow [2025-03-09 00:57:58,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:58,565 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;@66ba1e41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:58,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 00:57:58,566 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:58,566 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-09 00:57:58,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:58,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:58,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:58,567 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-09 00:57:58,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:58,567 INFO L85 PathProgramCache]: Analyzing trace with hash 345858, now seen corresponding path program 1 times [2025-03-09 00:57:58,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:58,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099118531] [2025-03-09 00:57:58,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:58,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:58,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:58,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:58,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:58,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:58,578 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-09 00:57:58,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:58,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099118531] [2025-03-09 00:57:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099118531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:58,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:58,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:57:58,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93382890] [2025-03-09 00:57:58,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:58,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:57:58,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:58,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:57:58,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:57:58,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 79 [2025-03-09 00:57:58,584 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-09 00:57:58,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:58,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 79 [2025-03-09 00:57:58,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:00,167 INFO L124 PetriNetUnfolderBase]: 14992/25038 cut-off events. [2025-03-09 00:58:00,167 INFO L125 PetriNetUnfolderBase]: For 2861/2861 co-relation queries the response was YES. [2025-03-09 00:58:00,291 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-09 00:58:00,408 INFO L140 encePairwiseOnDemand]: 70/79 looper letters, 27 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2025-03-09 00:58:00,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 210 flow [2025-03-09 00:58:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:58:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:58:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2025-03-09 00:58:00,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7088607594936709 [2025-03-09 00:58:00,409 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 186 flow. Second operand 2 states and 112 transitions. [2025-03-09 00:58:00,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 210 flow [2025-03-09 00:58:00,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 204 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-09 00:58:00,416 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 150 flow [2025-03-09 00:58:00,416 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-09 00:58:00,417 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-03-09 00:58:00,418 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 150 flow [2025-03-09 00:58:00,418 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-09 00:58:00,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:00,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:00,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:58:00,418 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-09 00:58:00,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1289793942, now seen corresponding path program 1 times [2025-03-09 00:58:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762277670] [2025-03-09 00:58:00,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:00,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:58:00,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:58:00,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:00,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:00,552 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-09 00:58:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:00,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762277670] [2025-03-09 00:58:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762277670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:00,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:58:00,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033031955] [2025-03-09 00:58:00,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:58:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:00,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:58:00,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:58:00,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 79 [2025-03-09 00:58:00,566 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-09 00:58:00,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:00,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 79 [2025-03-09 00:58:00,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:02,492 INFO L124 PetriNetUnfolderBase]: 28492/43617 cut-off events. [2025-03-09 00:58:02,493 INFO L125 PetriNetUnfolderBase]: For 1790/1790 co-relation queries the response was YES. [2025-03-09 00:58:02,645 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-09 00:58:03,084 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 70 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2025-03-09 00:58:03,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 408 flow [2025-03-09 00:58:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:58:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:58:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2025-03-09 00:58:03,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518987341772152 [2025-03-09 00:58:03,086 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 150 flow. Second operand 4 states and 206 transitions. [2025-03-09 00:58:03,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 408 flow [2025-03-09 00:58:03,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 105 transitions, 408 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:58:03,089 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 154 flow [2025-03-09 00:58:03,089 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-09 00:58:03,089 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2025-03-09 00:58:03,090 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 154 flow [2025-03-09 00:58:03,090 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-09 00:58:03,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:03,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:03,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:58:03,090 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-09 00:58:03,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1290777045, now seen corresponding path program 1 times [2025-03-09 00:58:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761985380] [2025-03-09 00:58:03,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:03,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:03,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:58:03,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:58:03,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:03,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:03,136 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-09 00:58:03,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761985380] [2025-03-09 00:58:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761985380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:03,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:03,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:58:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189817612] [2025-03-09 00:58:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:03,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:58:03,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:03,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:58:03,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:58:03,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 79 [2025-03-09 00:58:03,144 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-09 00:58:03,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:03,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 79 [2025-03-09 00:58:03,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:04,706 INFO L124 PetriNetUnfolderBase]: 28492/40509 cut-off events. [2025-03-09 00:58:04,707 INFO L125 PetriNetUnfolderBase]: For 2564/2564 co-relation queries the response was YES. [2025-03-09 00:58:04,795 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-09 00:58:04,931 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 71 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-09 00:58:04,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 404 flow [2025-03-09 00:58:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:58:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:58:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2025-03-09 00:58:04,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6392405063291139 [2025-03-09 00:58:04,933 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 154 flow. Second operand 4 states and 202 transitions. [2025-03-09 00:58:04,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 404 flow [2025-03-09 00:58:04,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:58:04,939 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 145 flow [2025-03-09 00:58:04,939 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-09 00:58:04,940 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-03-09 00:58:04,940 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 145 flow [2025-03-09 00:58:04,940 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-09 00:58:04,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:04,940 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:04,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:58:04,940 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-09 00:58:04,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:04,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1972322805, now seen corresponding path program 1 times [2025-03-09 00:58:04,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:04,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339570629] [2025-03-09 00:58:04,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:04,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:58:04,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:58:04,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:04,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:04,996 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-09 00:58:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:04,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339570629] [2025-03-09 00:58:04,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339570629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:04,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:04,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:58:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077796215] [2025-03-09 00:58:04,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:04,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:58:04,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:04,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:58:04,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:58:05,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 79 [2025-03-09 00:58:05,005 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-09 00:58:05,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:05,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 79 [2025-03-09 00:58:05,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:07,825 INFO L124 PetriNetUnfolderBase]: 38482/58644 cut-off events. [2025-03-09 00:58:07,825 INFO L125 PetriNetUnfolderBase]: For 3974/3974 co-relation queries the response was YES. [2025-03-09 00:58:07,942 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-09 00:58:08,106 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 68 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2025-03-09 00:58:08,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 389 flow [2025-03-09 00:58:08,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:58:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:58:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2025-03-09 00:58:08,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6455696202531646 [2025-03-09 00:58:08,107 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 145 flow. Second operand 4 states and 204 transitions. [2025-03-09 00:58:08,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 389 flow [2025-03-09 00:58:08,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:58:08,113 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 146 flow [2025-03-09 00:58:08,113 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-09 00:58:08,114 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2025-03-09 00:58:08,114 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 146 flow [2025-03-09 00:58:08,114 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-09 00:58:08,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:08,114 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:08,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:58:08,115 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-09 00:58:08,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:08,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1971339702, now seen corresponding path program 1 times [2025-03-09 00:58:08,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:08,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238831717] [2025-03-09 00:58:08,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:08,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:08,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:58:08,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:58:08,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:08,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:08,160 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-09 00:58:08,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:08,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238831717] [2025-03-09 00:58:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238831717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:08,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:08,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:58:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847323881] [2025-03-09 00:58:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:08,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:58:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:08,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:58:08,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:58:08,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 79 [2025-03-09 00:58:08,169 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-09 00:58:08,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:08,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 79 [2025-03-09 00:58:08,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:10,704 INFO L124 PetriNetUnfolderBase]: 38482/54516 cut-off events. [2025-03-09 00:58:10,704 INFO L125 PetriNetUnfolderBase]: For 3440/3440 co-relation queries the response was YES. [2025-03-09 00:58:10,859 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-09 00:58:11,022 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 69 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-03-09 00:58:11,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 378 flow [2025-03-09 00:58:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:58:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:58:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-03-09 00:58:11,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6329113924050633 [2025-03-09 00:58:11,025 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 146 flow. Second operand 4 states and 200 transitions. [2025-03-09 00:58:11,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 378 flow [2025-03-09 00:58:11,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:58:11,037 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 137 flow [2025-03-09 00:58:11,038 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-09 00:58:11,038 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2025-03-09 00:58:11,038 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 137 flow [2025-03-09 00:58:11,039 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-09 00:58:11,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:11,039 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:11,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:58:11,039 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-09 00:58:11,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash 477479721, now seen corresponding path program 1 times [2025-03-09 00:58:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:11,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767100043] [2025-03-09 00:58:11,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:11,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:11,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:58:11,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:58:11,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:11,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:11,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:58:11,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:58:11,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:58:11,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:11,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:11,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:58:11,057 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:58:11,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-09 00:58:11,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-09 00:58:11,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-09 00:58:11,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-03-09 00:58:11,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-09 00:58:11,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-09 00:58:11,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-09 00:58:11,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:58:11,058 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 00:58:11,058 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:58:11,059 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-09 00:58:11,088 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:58:11,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 97 transitions, 234 flow [2025-03-09 00:58:11,095 INFO L124 PetriNetUnfolderBase]: 20/121 cut-off events. [2025-03-09 00:58:11,095 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 00:58:11,096 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-09 00:58:11,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 97 transitions, 234 flow [2025-03-09 00:58:11,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 97 transitions, 234 flow [2025-03-09 00:58:11,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:58:11,099 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;@66ba1e41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:58:11,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 00:58:11,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:58:11,099 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-09 00:58:11,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:11,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:11,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:58:11,100 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-09 00:58:11,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash 442179, now seen corresponding path program 1 times [2025-03-09 00:58:11,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:11,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950048903] [2025-03-09 00:58:11,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:11,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:58:11,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:58:11,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:11,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:11,108 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-09 00:58:11,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:11,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950048903] [2025-03-09 00:58:11,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950048903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:11,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:11,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093394521] [2025-03-09 00:58:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:11,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:58:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:11,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:58:11,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:58:11,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-09 00:58:11,112 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-09 00:58:11,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:11,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-09 00:58:11,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:20,164 INFO L124 PetriNetUnfolderBase]: 113272/173556 cut-off events. [2025-03-09 00:58:20,164 INFO L125 PetriNetUnfolderBase]: For 26711/26711 co-relation queries the response was YES. [2025-03-09 00:58:20,749 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-09 00:58:21,567 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 33 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2025-03-09 00:58:21,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 264 flow [2025-03-09 00:58:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:58:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:58:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2025-03-09 00:58:21,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.711340206185567 [2025-03-09 00:58:21,568 INFO L175 Difference]: Start difference. First operand has 88 places, 97 transitions, 234 flow. Second operand 2 states and 138 transitions. [2025-03-09 00:58:21,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 264 flow [2025-03-09 00:58:21,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 252 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-09 00:58:21,580 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 186 flow [2025-03-09 00:58:21,581 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-09 00:58:21,581 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -7 predicate places. [2025-03-09 00:58:21,581 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 186 flow [2025-03-09 00:58:21,581 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-09 00:58:21,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:21,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:21,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:58:21,582 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-09 00:58:21,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -650715160, now seen corresponding path program 1 times [2025-03-09 00:58:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084125670] [2025-03-09 00:58:21,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:21,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:58:21,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:58:21,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:21,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:21,611 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-09 00:58:21,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:21,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084125670] [2025-03-09 00:58:21,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084125670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:21,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:21,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:58:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864274209] [2025-03-09 00:58:21,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:21,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:58:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:21,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:58:21,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:58:21,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 97 [2025-03-09 00:58:21,618 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-09 00:58:21,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:21,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 97 [2025-03-09 00:58:21,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand