./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-100.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:15:49,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:15:49,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:15:49,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:15:49,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:15:49,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:15:49,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:15:49,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:15:49,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:15:49,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:15:49,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:15:49,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:15:49,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:15:49,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:15:49,364 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:15:49,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:15:49,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:15:49,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:15:49,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:15:49,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:15:49,364 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:15:49,364 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:15:49,364 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:15:49,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:15:49,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:15:49,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:15:49,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:15:49,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:15:49,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:15:49,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:15:49,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:15:49,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:15:49,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:15:49,366 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-jdk21/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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-02-06 13:15:49,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:15:49,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:15:49,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:15:49,630 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:15:49,630 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:15:49,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-02-06 13:15:50,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16a92cb2d/2b9912cead364a6896410bb9a8bd8d9e/FLAG02e4f4d0b [2025-02-06 13:15:51,288 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:15:51,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-02-06 13:15:51,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16a92cb2d/2b9912cead364a6896410bb9a8bd8d9e/FLAG02e4f4d0b [2025-02-06 13:15:51,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16a92cb2d/2b9912cead364a6896410bb9a8bd8d9e [2025-02-06 13:15:51,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:15:51,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:15:51,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:15:51,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:15:51,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:15:51,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78267aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51, skipping insertion in model container [2025-02-06 13:15:51,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:15:51,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:15:51,794 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:15:51,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:15:51,862 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:15:51,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51 WrapperNode [2025-02-06 13:15:51,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:15:51,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:15:51,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:15:51,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:15:51,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,893 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2025-02-06 13:15:51,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:15:51,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:15:51,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:15:51,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:15:51,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,909 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-02-06 13:15:51,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:15:51,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:15:51,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:15:51,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:15:51,915 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (1/1) ... [2025-02-06 13:15:51,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:15:51,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:51,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:15:51,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:15:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:15:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-06 13:15:51,963 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-06 13:15:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-06 13:15:51,963 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-06 13:15:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:15:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:15:51,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:15:51,964 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:15:52,050 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:15:52,051 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:15:52,160 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:15:52,161 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:15:52,214 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:15:52,214 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:15:52,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:52 BoogieIcfgContainer [2025-02-06 13:15:52,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:15:52,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:15:52,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:15:52,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:15:52,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:15:51" (1/3) ... [2025-02-06 13:15:52,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbe2540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:15:52, skipping insertion in model container [2025-02-06 13:15:52,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:51" (2/3) ... [2025-02-06 13:15:52,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbe2540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:15:52, skipping insertion in model container [2025-02-06 13:15:52,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:52" (3/3) ... [2025-02-06 13:15:52,221 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-02-06 13:15:52,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:15:52,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-06 13:15:52,232 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:15:52,274 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 13:15:52,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-02-06 13:15:52,338 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-02-06 13:15:52,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:15:52,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 93 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-02-06 13:15:52,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-02-06 13:15:52,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2025-02-06 13:15:52,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:15:52,381 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;@39e15f65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:15:52,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 13:15:52,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:15:52,390 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-02-06 13:15:52,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:15:52,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:52,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:52,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:52,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:52,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1525933431, now seen corresponding path program 1 times [2025-02-06 13:15:52,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:52,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51265909] [2025-02-06 13:15:52,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:52,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:15:52,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:15:52,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:52,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:52,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:52,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51265909] [2025-02-06 13:15:52,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51265909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:52,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:52,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:15:52,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044260210] [2025-02-06 13:15:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:52,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:15:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:52,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:15:52,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:15:52,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-02-06 13:15:52,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-02-06 13:15:52,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:52,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-02-06 13:15:52,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:52,802 INFO L124 PetriNetUnfolderBase]: 98/222 cut-off events. [2025-02-06 13:15:52,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:15:52,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 222 events. 98/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 833 event pairs, 32 based on Foata normal form. 24/230 useless extension candidates. Maximal degree in co-relation 394. Up to 172 conditions per place. [2025-02-06 13:15:52,807 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 19 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-02-06 13:15:52,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 105 flow [2025-02-06 13:15:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:15:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:15:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-02-06 13:15:52,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2025-02-06 13:15:52,816 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 4 states and 49 transitions. [2025-02-06 13:15:52,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 105 flow [2025-02-06 13:15:52,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:15:52,821 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2025-02-06 13:15:52,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-02-06 13:15:52,824 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-02-06 13:15:52,824 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2025-02-06 13:15:52,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-02-06 13:15:52,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:52,825 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:52,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:15:52,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:52,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash -60284697, now seen corresponding path program 1 times [2025-02-06 13:15:52,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:52,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533984322] [2025-02-06 13:15:52,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:52,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:15:52,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:15:52,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:52,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:52,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:15:52,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:15:52,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:15:52,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:52,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:52,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:15:52,852 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:15:52,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 13:15:52,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-06 13:15:52,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-06 13:15:52,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-02-06 13:15:52,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-06 13:15:52,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:15:52,855 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 13:15:52,857 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 13:15:52,857 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 13:15:52,878 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 13:15:52,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 106 flow [2025-02-06 13:15:52,891 INFO L124 PetriNetUnfolderBase]: 9/65 cut-off events. [2025-02-06 13:15:52,891 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:15:52,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 65 events. 9/65 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 172 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 76. Up to 6 conditions per place. [2025-02-06 13:15:52,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 106 flow [2025-02-06 13:15:52,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 73 flow [2025-02-06 13:15:52,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:15:52,895 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;@39e15f65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:15:52,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 13:15:52,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:15:52,898 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-02-06 13:15:52,898 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:15:52,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:52,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:52,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:15:52,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:52,898 INFO L85 PathProgramCache]: Analyzing trace with hash -745877789, now seen corresponding path program 1 times [2025-02-06 13:15:52,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:52,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996826658] [2025-02-06 13:15:52,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:52,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:52,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:15:52,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:15:52,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:52,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:52,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996826658] [2025-02-06 13:15:52,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996826658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:52,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:15:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832498494] [2025-02-06 13:15:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:52,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:15:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:52,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:15:52,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:15:52,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 13:15:52,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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-02-06 13:15:52,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:52,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 13:15:52,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:53,105 INFO L124 PetriNetUnfolderBase]: 718/1286 cut-off events. [2025-02-06 13:15:53,106 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 13:15:53,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 1286 events. 718/1286 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6453 event pairs, 376 based on Foata normal form. 120/1302 useless extension candidates. Maximal degree in co-relation 540. Up to 1096 conditions per place. [2025-02-06 13:15:53,118 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 24 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-02-06 13:15:53,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 131 flow [2025-02-06 13:15:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:15:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:15:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-02-06 13:15:53,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38372093023255816 [2025-02-06 13:15:53,121 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 73 flow. Second operand 4 states and 66 transitions. [2025-02-06 13:15:53,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 131 flow [2025-02-06 13:15:53,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:15:53,124 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 80 flow [2025-02-06 13:15:53,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-02-06 13:15:53,126 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-02-06 13:15:53,126 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 80 flow [2025-02-06 13:15:53,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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-02-06 13:15:53,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:53,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:53,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:15:53,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:15:53,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash 737006519, now seen corresponding path program 1 times [2025-02-06 13:15:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:53,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845635704] [2025-02-06 13:15:53,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:53,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:53,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:15:53,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:15:53,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:53,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:53,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845635704] [2025-02-06 13:15:53,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845635704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:53,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:53,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:15:53,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860809661] [2025-02-06 13:15:53,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:53,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:15:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:53,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:15:53,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:15:53,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 13:15:53,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-02-06 13:15:53,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:53,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 13:15:53,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:53,311 INFO L124 PetriNetUnfolderBase]: 718/1262 cut-off events. [2025-02-06 13:15:53,312 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-06 13:15:53,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 1262 events. 718/1262 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6183 event pairs, 658 based on Foata normal form. 0/1178 useless extension candidates. Maximal degree in co-relation 2428. Up to 1101 conditions per place. [2025-02-06 13:15:53,316 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-02-06 13:15:53,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 122 flow [2025-02-06 13:15:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:15:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:15:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-02-06 13:15:53,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3798449612403101 [2025-02-06 13:15:53,317 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 80 flow. Second operand 3 states and 49 transitions. [2025-02-06 13:15:53,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 122 flow [2025-02-06 13:15:53,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:15:53,318 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 74 flow [2025-02-06 13:15:53,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2025-02-06 13:15:53,319 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2025-02-06 13:15:53,319 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 74 flow [2025-02-06 13:15:53,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-02-06 13:15:53,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:53,319 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:53,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:15:53,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:15:53,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1371377074, now seen corresponding path program 1 times [2025-02-06 13:15:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812101886] [2025-02-06 13:15:53,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:53,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:15:53,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:15:53,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:53,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:53,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:15:53,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:15:53,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:15:53,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:53,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:53,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:15:53,338 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:15:53,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 13:15:53,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 13:15:53,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-06 13:15:53,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-02-06 13:15:53,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-06 13:15:53,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 13:15:53,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:15:53,338 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 13:15:53,339 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 13:15:53,339 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 13:15:53,358 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 13:15:53,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 154 flow [2025-02-06 13:15:53,365 INFO L124 PetriNetUnfolderBase]: 12/87 cut-off events. [2025-02-06 13:15:53,365 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 13:15:53,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 87 events. 12/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 252 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2025-02-06 13:15:53,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 59 transitions, 154 flow [2025-02-06 13:15:53,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 34 transitions, 89 flow [2025-02-06 13:15:53,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:15:53,367 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;@39e15f65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:15:53,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 13:15:53,368 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:15:53,368 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-02-06 13:15:53,369 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:15:53,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:53,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:53,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 13:15:53,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1822670157, now seen corresponding path program 1 times [2025-02-06 13:15:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:53,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-02-06 13:15:53,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:53,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:53,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:15:53,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:15:53,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:53,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-02-06 13:15:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471045538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:53,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:53,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:15:53,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546822345] [2025-02-06 13:15:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:53,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:15:53,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:53,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:15:53,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:15:53,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-02-06 13:15:53,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-02-06 13:15:53,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:53,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-02-06 13:15:53,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:53,927 INFO L124 PetriNetUnfolderBase]: 4110/6046 cut-off events. [2025-02-06 13:15:53,927 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-02-06 13:15:53,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12008 conditions, 6046 events. 4110/6046 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 30500 event pairs, 2664 based on Foata normal form. 456/6142 useless extension candidates. Maximal degree in co-relation 2438. Up to 5704 conditions per place. [2025-02-06 13:15:53,966 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 28 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-02-06 13:15:53,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 155 flow [2025-02-06 13:15:53,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:15:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:15:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-02-06 13:15:53,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3474576271186441 [2025-02-06 13:15:53,968 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 89 flow. Second operand 4 states and 82 transitions. [2025-02-06 13:15:53,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 155 flow [2025-02-06 13:15:53,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 152 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 13:15:53,972 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 94 flow [2025-02-06 13:15:53,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2025-02-06 13:15:53,974 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-02-06 13:15:53,974 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 94 flow [2025-02-06 13:15:53,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-02-06 13:15:53,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:53,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:53,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:15:53,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 13:15:53,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1182964120, now seen corresponding path program 1 times [2025-02-06 13:15:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:53,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085670] [2025-02-06 13:15:53,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:53,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:15:53,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:15:53,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:53,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:54,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:54,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085670] [2025-02-06 13:15:54,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:54,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:54,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:15:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29176124] [2025-02-06 13:15:54,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:54,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:15:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:54,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:15:54,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:15:54,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-02-06 13:15:54,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-02-06 13:15:54,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:54,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-02-06 13:15:54,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:54,359 INFO L124 PetriNetUnfolderBase]: 4110/6022 cut-off events. [2025-02-06 13:15:54,360 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-02-06 13:15:54,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12142 conditions, 6022 events. 4110/6022 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 30153 event pairs, 3858 based on Foata normal form. 0/5746 useless extension candidates. Maximal degree in co-relation 8876. Up to 5709 conditions per place. [2025-02-06 13:15:54,379 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 24 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2025-02-06 13:15:54,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 144 flow [2025-02-06 13:15:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:15:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:15:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-02-06 13:15:54,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3502824858757062 [2025-02-06 13:15:54,383 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 94 flow. Second operand 3 states and 62 transitions. [2025-02-06 13:15:54,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 144 flow [2025-02-06 13:15:54,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:15:54,384 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 88 flow [2025-02-06 13:15:54,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2025-02-06 13:15:54,385 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-02-06 13:15:54,386 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 88 flow [2025-02-06 13:15:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-02-06 13:15:54,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:54,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:15:54,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 13:15:54,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:54,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1508871785, now seen corresponding path program 1 times [2025-02-06 13:15:54,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:54,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-02-06 13:15:54,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:54,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:54,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:15:54,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:15:54,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:54,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:54,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-02-06 13:15:54,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825343523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:54,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:54,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:15:54,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962821292] [2025-02-06 13:15:54,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:54,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:15:54,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:54,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:15:54,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:15:54,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-02-06 13:15:54,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-02-06 13:15:54,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:54,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-02-06 13:15:54,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:54,991 INFO L124 PetriNetUnfolderBase]: 6153/8833 cut-off events. [2025-02-06 13:15:54,991 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-02-06 13:15:55,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17748 conditions, 8833 events. 6153/8833 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 45291 event pairs, 3177 based on Foata normal form. 0/8077 useless extension candidates. Maximal degree in co-relation 17738. Up to 4776 conditions per place. [2025-02-06 13:15:55,030 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 34 selfloop transitions, 3 changer transitions 25/66 dead transitions. [2025-02-06 13:15:55,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 284 flow [2025-02-06 13:15:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:15:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:15:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-02-06 13:15:55,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3785310734463277 [2025-02-06 13:15:55,033 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 88 flow. Second operand 6 states and 134 transitions. [2025-02-06 13:15:55,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 284 flow [2025-02-06 13:15:55,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:15:55,035 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 101 flow [2025-02-06 13:15:55,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2025-02-06 13:15:55,036 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2025-02-06 13:15:55,037 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 101 flow [2025-02-06 13:15:55,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-02-06 13:15:55,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:55,037 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:55,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:15:55,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 13:15:55,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1713799610, now seen corresponding path program 1 times [2025-02-06 13:15:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:55,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132867255] [2025-02-06 13:15:55,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:55,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:15:55,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:15:55,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:55,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:55,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:15:55,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:15:55,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:15:55,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:55,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:55,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:15:55,068 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:15:55,068 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 13:15:55,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 13:15:55,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-02-06 13:15:55,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-02-06 13:15:55,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-02-06 13:15:55,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-06 13:15:55,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 13:15:55,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:15:55,069 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 13:15:55,069 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 13:15:55,069 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 13:15:55,100 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 13:15:55,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 75 transitions, 206 flow [2025-02-06 13:15:55,106 INFO L124 PetriNetUnfolderBase]: 15/109 cut-off events. [2025-02-06 13:15:55,107 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 13:15:55,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 109 events. 15/109 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 335 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 133. Up to 10 conditions per place. [2025-02-06 13:15:55,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 75 transitions, 206 flow [2025-02-06 13:15:55,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 107 flow [2025-02-06 13:15:55,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:15:55,109 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;@39e15f65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:15:55,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 13:15:55,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:15:55,110 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-02-06 13:15:55,110 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:15:55,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:55,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:55,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 13:15:55,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1884743111, now seen corresponding path program 1 times [2025-02-06 13:15:55,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:55,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717716113] [2025-02-06 13:15:55,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:55,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:15:55,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:15:55,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:55,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717716113] [2025-02-06 13:15:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717716113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:55,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:55,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:15:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333753051] [2025-02-06 13:15:55,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:15:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:55,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:15:55,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:15:55,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-02-06 13:15:55,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-02-06 13:15:55,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:55,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-02-06 13:15:55,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:56,541 INFO L124 PetriNetUnfolderBase]: 21326/28642 cut-off events. [2025-02-06 13:15:56,541 INFO L125 PetriNetUnfolderBase]: For 1224/1224 co-relation queries the response was YES. [2025-02-06 13:15:56,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57517 conditions, 28642 events. 21326/28642 cut-off events. For 1224/1224 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 148552 event pairs, 15464 based on Foata normal form. 1992/29250 useless extension candidates. Maximal degree in co-relation 11990. Up to 27784 conditions per place. [2025-02-06 13:15:56,647 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 32 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-02-06 13:15:56,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 181 flow [2025-02-06 13:15:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:15:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:15:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-02-06 13:15:56,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32666666666666666 [2025-02-06 13:15:56,649 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 107 flow. Second operand 4 states and 98 transitions. [2025-02-06 13:15:56,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 181 flow [2025-02-06 13:15:56,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 174 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 13:15:56,658 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 108 flow [2025-02-06 13:15:56,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-02-06 13:15:56,659 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-02-06 13:15:56,659 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 108 flow [2025-02-06 13:15:56,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-02-06 13:15:56,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:56,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:56,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:15:56,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 13:15:56,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash -761108103, now seen corresponding path program 1 times [2025-02-06 13:15:56,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:56,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624666802] [2025-02-06 13:15:56,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:56,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:56,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:15:56,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:15:56,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:56,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624666802] [2025-02-06 13:15:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624666802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:15:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170279079] [2025-02-06 13:15:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:56,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:15:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:56,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:15:56,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:15:56,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-02-06 13:15:56,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-06 13:15:56,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:56,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-02-06 13:15:56,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:58,221 INFO L124 PetriNetUnfolderBase]: 21326/28570 cut-off events. [2025-02-06 13:15:58,221 INFO L125 PetriNetUnfolderBase]: For 1058/1058 co-relation queries the response was YES. [2025-02-06 13:15:58,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57987 conditions, 28570 events. 21326/28570 cut-off events. For 1058/1058 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 147589 event pairs, 20306 based on Foata normal form. 0/27526 useless extension candidates. Maximal degree in co-relation 57944. Up to 27789 conditions per place. [2025-02-06 13:15:58,308 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 28 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 13:15:58,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 166 flow [2025-02-06 13:15:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:15:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:15:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-02-06 13:15:58,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-02-06 13:15:58,309 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 108 flow. Second operand 3 states and 75 transitions. [2025-02-06 13:15:58,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 166 flow [2025-02-06 13:15:58,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:15:58,311 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 102 flow [2025-02-06 13:15:58,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-02-06 13:15:58,312 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2025-02-06 13:15:58,312 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 102 flow [2025-02-06 13:15:58,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-06 13:15:58,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:58,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:58,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:15:58,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 13:15:58,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:58,313 INFO L85 PathProgramCache]: Analyzing trace with hash -994269599, now seen corresponding path program 1 times [2025-02-06 13:15:58,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:58,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928144065] [2025-02-06 13:15:58,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:58,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:15:58,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:15:58,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:58,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928144065] [2025-02-06 13:15:58,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928144065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:58,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:15:58,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306410323] [2025-02-06 13:15:58,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:58,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:15:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:58,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:15:58,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:15:58,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-02-06 13:15:58,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-02-06 13:15:58,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:58,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-02-06 13:15:58,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:01,030 INFO L124 PetriNetUnfolderBase]: 31817/41989 cut-off events. [2025-02-06 13:16:01,031 INFO L125 PetriNetUnfolderBase]: For 1057/1057 co-relation queries the response was YES. [2025-02-06 13:16:01,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84953 conditions, 41989 events. 31817/41989 cut-off events. For 1057/1057 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 219932 event pairs, 16809 based on Foata normal form. 0/38929 useless extension candidates. Maximal degree in co-relation 84942. Up to 23272 conditions per place. [2025-02-06 13:16:01,177 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 41 selfloop transitions, 3 changer transitions 31/79 dead transitions. [2025-02-06 13:16:01,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 342 flow [2025-02-06 13:16:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:16:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:16:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-02-06 13:16:01,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-02-06 13:16:01,178 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 102 flow. Second operand 6 states and 165 transitions. [2025-02-06 13:16:01,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 342 flow [2025-02-06 13:16:01,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:16:01,181 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 115 flow [2025-02-06 13:16:01,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-02-06 13:16:01,181 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2025-02-06 13:16:01,181 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 115 flow [2025-02-06 13:16:01,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-02-06 13:16:01,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:01,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:01,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:16:01,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 13:16:01,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash -758572174, now seen corresponding path program 1 times [2025-02-06 13:16:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:16:01,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431427974] [2025-02-06 13:16:01,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:01,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:16:01,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:16:01,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:16:01,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:01,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:16:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:16:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431427974] [2025-02-06 13:16:01,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431427974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:16:01,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:16:01,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:16:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12094459] [2025-02-06 13:16:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:16:01,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:16:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:16:01,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:16:01,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:16:01,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-02-06 13:16:01,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-02-06 13:16:01,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:01,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-02-06 13:16:01,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:02,688 INFO L124 PetriNetUnfolderBase]: 21234/28546 cut-off events. [2025-02-06 13:16:02,688 INFO L125 PetriNetUnfolderBase]: For 6099/6099 co-relation queries the response was YES. [2025-02-06 13:16:02,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63843 conditions, 28546 events. 21234/28546 cut-off events. For 6099/6099 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 144097 event pairs, 10656 based on Foata normal form. 4/27542 useless extension candidates. Maximal degree in co-relation 63829. Up to 27586 conditions per place. [2025-02-06 13:16:02,797 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 39 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-02-06 13:16:02,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 227 flow [2025-02-06 13:16:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:16:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:16:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-02-06 13:16:02,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31466666666666665 [2025-02-06 13:16:02,798 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 115 flow. Second operand 5 states and 118 transitions. [2025-02-06 13:16:02,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 227 flow [2025-02-06 13:16:02,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 219 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 13:16:02,891 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 125 flow [2025-02-06 13:16:02,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-02-06 13:16:02,892 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2025-02-06 13:16:02,892 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 125 flow [2025-02-06 13:16:02,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-02-06 13:16:02,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:02,892 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:02,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:16:02,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 13:16:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1091642209, now seen corresponding path program 1 times [2025-02-06 13:16:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:16:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26193272] [2025-02-06 13:16:02,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:16:02,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:16:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:16:02,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:02,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:16:02,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:16:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26193272] [2025-02-06 13:16:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26193272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:16:02,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:16:02,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:16:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533687710] [2025-02-06 13:16:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:16:02,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:16:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:16:02,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:16:02,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:16:02,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-02-06 13:16:02,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-02-06 13:16:02,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:02,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-02-06 13:16:02,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:04,333 INFO L124 PetriNetUnfolderBase]: 20674/28802 cut-off events. [2025-02-06 13:16:04,334 INFO L125 PetriNetUnfolderBase]: For 3122/3122 co-relation queries the response was YES. [2025-02-06 13:16:04,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60744 conditions, 28802 events. 20674/28802 cut-off events. For 3122/3122 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 158434 event pairs, 6016 based on Foata normal form. 16/27858 useless extension candidates. Maximal degree in co-relation 60730. Up to 26530 conditions per place. [2025-02-06 13:16:04,429 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 49 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2025-02-06 13:16:04,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 281 flow [2025-02-06 13:16:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:16:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:16:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-02-06 13:16:04,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-02-06 13:16:04,438 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 125 flow. Second operand 6 states and 144 transitions. [2025-02-06 13:16:04,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 281 flow [2025-02-06 13:16:04,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 273 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 13:16:04,484 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 139 flow [2025-02-06 13:16:04,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-02-06 13:16:04,484 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2025-02-06 13:16:04,484 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 139 flow [2025-02-06 13:16:04,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-02-06 13:16:04,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:04,484 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:04,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:16:04,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 13:16:04,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1546404659, now seen corresponding path program 1 times [2025-02-06 13:16:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:16:04,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912530909] [2025-02-06 13:16:04,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:16:04,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:16:04,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:16:04,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:04,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:16:04,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:16:04,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:16:04,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:16:04,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:04,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:16:04,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:16:04,520 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:16:04,520 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-06 13:16:04,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-02-06 13:16:04,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-02-06 13:16:04,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-02-06 13:16:04,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-02-06 13:16:04,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-02-06 13:16:04,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-02-06 13:16:04,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-06 13:16:04,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:16:04,520 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 13:16:04,521 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 13:16:04,521 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 13:16:04,577 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 13:16:04,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 91 transitions, 262 flow [2025-02-06 13:16:04,583 INFO L124 PetriNetUnfolderBase]: 18/131 cut-off events. [2025-02-06 13:16:04,586 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 13:16:04,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 131 events. 18/131 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 163. Up to 12 conditions per place. [2025-02-06 13:16:04,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 91 transitions, 262 flow [2025-02-06 13:16:04,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 42 transitions, 127 flow [2025-02-06 13:16:04,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:16:04,591 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;@39e15f65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:16:04,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 13:16:04,592 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:16:04,592 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-02-06 13:16:04,592 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:16:04,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:04,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:04,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 13:16:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash -559658927, now seen corresponding path program 1 times [2025-02-06 13:16:04,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:16:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515414845] [2025-02-06 13:16:04,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:16:04,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:16:04,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:16:04,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:04,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:04,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:16:04,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515414845] [2025-02-06 13:16:04,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515414845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:16:04,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:16:04,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:16:04,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956073064] [2025-02-06 13:16:04,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:16:04,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:16:04,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:16:04,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:16:04,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:16:04,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 91 [2025-02-06 13:16:04,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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-02-06 13:16:04,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:04,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 91 [2025-02-06 13:16:04,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:10,096 INFO L124 PetriNetUnfolderBase]: 104782/133618 cut-off events. [2025-02-06 13:16:10,097 INFO L125 PetriNetUnfolderBase]: For 7304/7304 co-relation queries the response was YES. [2025-02-06 13:16:10,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268990 conditions, 133618 events. 104782/133618 cut-off events. For 7304/7304 co-relation queries the response was YES. Maximal size of possible extension queue 3254. Compared 719081 event pairs, 81256 based on Foata normal form. 8136/136274 useless extension candidates. Maximal degree in co-relation 57524. Up to 130696 conditions per place. [2025-02-06 13:16:10,632 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 36 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-02-06 13:16:10,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 209 flow [2025-02-06 13:16:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:16:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:16:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-06 13:16:10,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3131868131868132 [2025-02-06 13:16:10,634 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 127 flow. Second operand 4 states and 114 transitions. [2025-02-06 13:16:10,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 209 flow [2025-02-06 13:16:10,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 44 transitions, 196 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 13:16:10,694 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 122 flow [2025-02-06 13:16:10,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-02-06 13:16:10,695 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-02-06 13:16:10,695 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 122 flow [2025-02-06 13:16:10,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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-02-06 13:16:10,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:10,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:16:10,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 13:16:10,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash -800242854, now seen corresponding path program 1 times [2025-02-06 13:16:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:16:10,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-02-06 13:16:10,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:16:10,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:16:10,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:16:10,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:10,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:16:10,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-02-06 13:16:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708350996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:16:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:16:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:16:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149463212] [2025-02-06 13:16:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:16:10,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:16:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:16:10,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:16:10,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:16:10,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 91 [2025-02-06 13:16:10,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:10,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:10,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 91 [2025-02-06 13:16:10,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:15,966 INFO L124 PetriNetUnfolderBase]: 104782/133354 cut-off events. [2025-02-06 13:16:15,966 INFO L125 PetriNetUnfolderBase]: For 5011/5011 co-relation queries the response was YES. [2025-02-06 13:16:16,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270548 conditions, 133354 events. 104782/133354 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 3255. Compared 714066 event pairs, 100690 based on Foata normal form. 0/129238 useless extension candidates. Maximal degree in co-relation 199639. Up to 130701 conditions per place. [2025-02-06 13:16:16,814 INFO L140 encePairwiseOnDemand]: 89/91 looper letters, 32 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-02-06 13:16:16,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 39 transitions, 188 flow [2025-02-06 13:16:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:16:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:16:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-06 13:16:16,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32234432234432236 [2025-02-06 13:16:16,815 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 122 flow. Second operand 3 states and 88 transitions. [2025-02-06 13:16:16,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 39 transitions, 188 flow [2025-02-06 13:16:16,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 39 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:16:16,823 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 116 flow [2025-02-06 13:16:16,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2025-02-06 13:16:16,824 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2025-02-06 13:16:16,824 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 116 flow [2025-02-06 13:16:16,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:16,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:16,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:16:16,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 13:16:16,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1355426440, now seen corresponding path program 1 times [2025-02-06 13:16:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:16:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299741317] [2025-02-06 13:16:16,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:16:16,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:16:16,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:16:16,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:16,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:16,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:16:16,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299741317] [2025-02-06 13:16:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299741317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:16:16,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:16:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:16:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163692536] [2025-02-06 13:16:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:16:16,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:16:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:16:16,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:16:16,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:16:16,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 91 [2025-02-06 13:16:16,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 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-02-06 13:16:16,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:16,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 91 [2025-02-06 13:16:16,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand