./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/szymanski.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-atomic/szymanski.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 a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:35:40,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:35:40,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:35:41,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:35:41,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:35:41,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:35:41,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:35:41,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:35:41,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:35:41,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:35:41,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:35:41,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:35:41,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:35:41,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:35:41,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:35:41,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:35:41,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:41,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:35:41,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:35:41,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:35:41,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:35:41,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:35:41,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:35:41,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:35:41,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:35:41,036 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 -> a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 [2025-02-06 12:35:41,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:35:41,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:35:41,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:35:41,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:35:41,273 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:35:41,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/szymanski.i [2025-02-06 12:35:42,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8616ccc7/57fd870c60ef49f38a0153e3760df8f3/FLAG30578c567 [2025-02-06 12:35:42,619 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:35:42,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/szymanski.i [2025-02-06 12:35:42,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8616ccc7/57fd870c60ef49f38a0153e3760df8f3/FLAG30578c567 [2025-02-06 12:35:42,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8616ccc7/57fd870c60ef49f38a0153e3760df8f3 [2025-02-06 12:35:42,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:35:42,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:35:42,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:42,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:35:42,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:35:42,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:42" (1/1) ... [2025-02-06 12:35:42,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6b29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:42, skipping insertion in model container [2025-02-06 12:35:42,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:42" (1/1) ... [2025-02-06 12:35:42,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:35:43,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:43,156 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:35:43,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:43,218 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:35:43,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43 WrapperNode [2025-02-06 12:35:43,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:43,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:43,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:35:43,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:35:43,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,242 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2025-02-06 12:35:43,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:43,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:35:43,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:35:43,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:35:43,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,264 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 12:35:43,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:35:43,284 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:35:43,284 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:35:43,284 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:35:43,285 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (1/1) ... [2025-02-06 12:35:43,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:43,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:43,311 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 12:35:43,316 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 12:35:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-06 12:35:43,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-06 12:35:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 12:35:43,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 12:35:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:35:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:35:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:35:43,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:35:43,333 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 12:35:43,405 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:35:43,407 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:35:43,489 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:35:43,489 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:35:43,534 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:35:43,534 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:35:43,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:43 BoogieIcfgContainer [2025-02-06 12:35:43,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:35:43,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:35:43,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:35:43,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:35:43,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:35:42" (1/3) ... [2025-02-06 12:35:43,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70955f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:43, skipping insertion in model container [2025-02-06 12:35:43,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:43" (2/3) ... [2025-02-06 12:35:43,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70955f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:43, skipping insertion in model container [2025-02-06 12:35:43,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:43" (3/3) ... [2025-02-06 12:35:43,542 INFO L128 eAbstractionObserver]: Analyzing ICFG szymanski.i [2025-02-06 12:35:43,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:35:43,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG szymanski.i that has 3 procedures, 47 locations, 1 initial locations, 8 loop locations, and 3 error locations. [2025-02-06 12:35:43,554 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:35:43,608 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:35:43,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 60 transitions, 134 flow [2025-02-06 12:35:43,668 INFO L124 PetriNetUnfolderBase]: 14/58 cut-off events. [2025-02-06 12:35:43,670 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:35:43,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 58 events. 14/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-02-06 12:35:43,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 60 transitions, 134 flow [2025-02-06 12:35:43,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 57 transitions, 126 flow [2025-02-06 12:35:43,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:35:43,694 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;@303f879f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:35:43,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:35:43,701 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:35:43,701 INFO L124 PetriNetUnfolderBase]: 11/40 cut-off events. [2025-02-06 12:35:43,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:43,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:43,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:43,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:35:43,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1794690969, now seen corresponding path program 1 times [2025-02-06 12:35:43,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:43,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850736467] [2025-02-06 12:35:43,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:43,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:43,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:35:43,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:35:43,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:43,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:43,898 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 12:35:43,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:43,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850736467] [2025-02-06 12:35:43,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850736467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:43,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:43,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736869472] [2025-02-06 12:35:43,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:43,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:43,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:43,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:43,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-02-06 12:35:43,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 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 12:35:43,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:43,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-02-06 12:35:43,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:44,133 INFO L124 PetriNetUnfolderBase]: 330/707 cut-off events. [2025-02-06 12:35:44,134 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 12:35:44,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 707 events. 330/707 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3772 event pairs, 136 based on Foata normal form. 94/706 useless extension candidates. Maximal degree in co-relation 1154. Up to 287 conditions per place. [2025-02-06 12:35:44,146 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 34 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2025-02-06 12:35:44,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 220 flow [2025-02-06 12:35:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-02-06 12:35:44,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2025-02-06 12:35:44,160 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 126 flow. Second operand 3 states and 138 transitions. [2025-02-06 12:35:44,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 220 flow [2025-02-06 12:35:44,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:35:44,169 INFO L231 Difference]: Finished difference. Result has 48 places, 52 transitions, 126 flow [2025-02-06 12:35:44,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=52} [2025-02-06 12:35:44,174 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-02-06 12:35:44,174 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 126 flow [2025-02-06 12:35:44,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 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 12:35:44,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:44,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:44,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:35:44,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:35:44,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2128480827, now seen corresponding path program 1 times [2025-02-06 12:35:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:44,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189349791] [2025-02-06 12:35:44,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:44,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:35:44,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:35:44,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:44,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:44,246 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 12:35:44,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:44,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189349791] [2025-02-06 12:35:44,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189349791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:44,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:44,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155730594] [2025-02-06 12:35:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:44,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:44,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:44,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:44,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-02-06 12:35:44,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 12:35:44,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:44,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-02-06 12:35:44,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:44,353 INFO L124 PetriNetUnfolderBase]: 312/658 cut-off events. [2025-02-06 12:35:44,353 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-06 12:35:44,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 658 events. 312/658 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3358 event pairs, 161 based on Foata normal form. 27/609 useless extension candidates. Maximal degree in co-relation 576. Up to 334 conditions per place. [2025-02-06 12:35:44,359 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 34 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-02-06 12:35:44,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 222 flow [2025-02-06 12:35:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-02-06 12:35:44,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7277777777777777 [2025-02-06 12:35:44,361 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 126 flow. Second operand 3 states and 131 transitions. [2025-02-06 12:35:44,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 222 flow [2025-02-06 12:35:44,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:44,363 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 130 flow [2025-02-06 12:35:44,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2025-02-06 12:35:44,365 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-02-06 12:35:44,365 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 130 flow [2025-02-06 12:35:44,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 12:35:44,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:44,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:44,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:35:44,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:35:44,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash 375103280, now seen corresponding path program 1 times [2025-02-06 12:35:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:44,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473773113] [2025-02-06 12:35:44,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:44,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:35:44,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:35:44,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:44,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:44,430 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 12:35:44,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:44,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473773113] [2025-02-06 12:35:44,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473773113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:44,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:44,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:44,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870627914] [2025-02-06 12:35:44,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:44,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:44,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:44,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:44,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-02-06 12:35:44,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 12:35:44,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:44,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-02-06 12:35:44,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:44,540 INFO L124 PetriNetUnfolderBase]: 394/748 cut-off events. [2025-02-06 12:35:44,540 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-02-06 12:35:44,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 748 events. 394/748 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3414 event pairs, 188 based on Foata normal form. 31/742 useless extension candidates. Maximal degree in co-relation 890. Up to 398 conditions per place. [2025-02-06 12:35:44,543 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 36 selfloop transitions, 6 changer transitions 2/66 dead transitions. [2025-02-06 12:35:44,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 248 flow [2025-02-06 12:35:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-02-06 12:35:44,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7277777777777777 [2025-02-06 12:35:44,545 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 130 flow. Second operand 3 states and 131 transitions. [2025-02-06 12:35:44,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 248 flow [2025-02-06 12:35:44,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:35:44,548 INFO L231 Difference]: Finished difference. Result has 49 places, 54 transitions, 172 flow [2025-02-06 12:35:44,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=49, PETRI_TRANSITIONS=54} [2025-02-06 12:35:44,549 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-02-06 12:35:44,549 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 54 transitions, 172 flow [2025-02-06 12:35:44,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 12:35:44,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:44,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:44,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:35:44,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:35:44,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash -912915776, now seen corresponding path program 1 times [2025-02-06 12:35:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:44,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768953123] [2025-02-06 12:35:44,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:44,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:44,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:35:44,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:35:44,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:44,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:44,618 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 12:35:44,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:44,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768953123] [2025-02-06 12:35:44,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768953123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:44,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:44,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:44,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532399147] [2025-02-06 12:35:44,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:44,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:44,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:44,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-02-06 12:35:44,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 54 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 12:35:44,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:44,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-02-06 12:35:44,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:44,719 INFO L124 PetriNetUnfolderBase]: 440/848 cut-off events. [2025-02-06 12:35:44,720 INFO L125 PetriNetUnfolderBase]: For 409/413 co-relation queries the response was YES. [2025-02-06 12:35:44,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 848 events. 440/848 cut-off events. For 409/413 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3910 event pairs, 156 based on Foata normal form. 17/806 useless extension candidates. Maximal degree in co-relation 906. Up to 322 conditions per place. [2025-02-06 12:35:44,723 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 38 selfloop transitions, 9 changer transitions 2/71 dead transitions. [2025-02-06 12:35:44,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 320 flow [2025-02-06 12:35:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-02-06 12:35:44,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-02-06 12:35:44,724 INFO L175 Difference]: Start difference. First operand has 49 places, 54 transitions, 172 flow. Second operand 3 states and 130 transitions. [2025-02-06 12:35:44,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 320 flow [2025-02-06 12:35:44,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:44,727 INFO L231 Difference]: Finished difference. Result has 51 places, 59 transitions, 230 flow [2025-02-06 12:35:44,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=51, PETRI_TRANSITIONS=59} [2025-02-06 12:35:44,727 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2025-02-06 12:35:44,728 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 59 transitions, 230 flow [2025-02-06 12:35:44,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 12:35:44,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:44,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:44,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:35:44,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:35:44,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash 436949070, now seen corresponding path program 2 times [2025-02-06 12:35:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459889718] [2025-02-06 12:35:44,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:44,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:35:44,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:35:44,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:35:44,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:44,766 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 12:35:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:44,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459889718] [2025-02-06 12:35:44,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459889718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:44,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:44,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:44,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713911224] [2025-02-06 12:35:44,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:44,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:44,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:44,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:44,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:44,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-02-06 12:35:44,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 59 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 12:35:44,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:44,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-02-06 12:35:44,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:44,862 INFO L124 PetriNetUnfolderBase]: 459/869 cut-off events. [2025-02-06 12:35:44,862 INFO L125 PetriNetUnfolderBase]: For 986/989 co-relation queries the response was YES. [2025-02-06 12:35:44,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 869 events. 459/869 cut-off events. For 986/989 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4006 event pairs, 222 based on Foata normal form. 19/812 useless extension candidates. Maximal degree in co-relation 1022. Up to 580 conditions per place. [2025-02-06 12:35:44,866 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 44 selfloop transitions, 5 changer transitions 2/71 dead transitions. [2025-02-06 12:35:44,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 368 flow [2025-02-06 12:35:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-02-06 12:35:44,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-02-06 12:35:44,868 INFO L175 Difference]: Start difference. First operand has 51 places, 59 transitions, 230 flow. Second operand 3 states and 126 transitions. [2025-02-06 12:35:44,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 368 flow [2025-02-06 12:35:44,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:44,873 INFO L231 Difference]: Finished difference. Result has 53 places, 59 transitions, 250 flow [2025-02-06 12:35:44,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=53, PETRI_TRANSITIONS=59} [2025-02-06 12:35:44,874 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2025-02-06 12:35:44,874 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 250 flow [2025-02-06 12:35:44,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 12:35:44,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:44,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:44,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:35:44,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:35:44,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2076379600, now seen corresponding path program 3 times [2025-02-06 12:35:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:44,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727874984] [2025-02-06 12:35:44,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:35:44,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:44,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:35:44,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:35:44,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:35:44,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:44,913 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 12:35:44,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:44,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727874984] [2025-02-06 12:35:44,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727874984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:44,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:44,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150115503] [2025-02-06 12:35:44,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:44,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:44,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:44,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:44,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-02-06 12:35:44,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 59 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 12:35:44,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:44,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-02-06 12:35:44,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:45,020 INFO L124 PetriNetUnfolderBase]: 502/941 cut-off events. [2025-02-06 12:35:45,020 INFO L125 PetriNetUnfolderBase]: For 962/1000 co-relation queries the response was YES. [2025-02-06 12:35:45,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 941 events. 502/941 cut-off events. For 962/1000 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4434 event pairs, 204 based on Foata normal form. 38/949 useless extension candidates. Maximal degree in co-relation 1397. Up to 482 conditions per place. [2025-02-06 12:35:45,024 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 45 selfloop transitions, 6 changer transitions 1/76 dead transitions. [2025-02-06 12:35:45,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 436 flow [2025-02-06 12:35:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-02-06 12:35:45,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-02-06 12:35:45,024 INFO L175 Difference]: Start difference. First operand has 53 places, 59 transitions, 250 flow. Second operand 3 states and 129 transitions. [2025-02-06 12:35:45,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 436 flow [2025-02-06 12:35:45,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 416 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:45,028 INFO L231 Difference]: Finished difference. Result has 52 places, 61 transitions, 282 flow [2025-02-06 12:35:45,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=52, PETRI_TRANSITIONS=61} [2025-02-06 12:35:45,028 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-02-06 12:35:45,028 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 61 transitions, 282 flow [2025-02-06 12:35:45,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 12:35:45,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:45,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:45,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:35:45,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:35:45,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash -204728210, now seen corresponding path program 1 times [2025-02-06 12:35:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561844819] [2025-02-06 12:35:45,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:45,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:45,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:35:45,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:35:45,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:45,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:45,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:45,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561844819] [2025-02-06 12:35:45,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561844819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:45,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:45,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:45,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845722067] [2025-02-06 12:35:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:45,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:45,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:45,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:45,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:45,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-02-06 12:35:45,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 61 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 12:35:45,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:45,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-02-06 12:35:45,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:45,197 INFO L124 PetriNetUnfolderBase]: 489/910 cut-off events. [2025-02-06 12:35:45,197 INFO L125 PetriNetUnfolderBase]: For 1089/1138 co-relation queries the response was YES. [2025-02-06 12:35:45,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2622 conditions, 910 events. 489/910 cut-off events. For 1089/1138 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4259 event pairs, 220 based on Foata normal form. 30/897 useless extension candidates. Maximal degree in co-relation 1856. Up to 604 conditions per place. [2025-02-06 12:35:45,204 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 48 selfloop transitions, 5 changer transitions 1/76 dead transitions. [2025-02-06 12:35:45,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 456 flow [2025-02-06 12:35:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-02-06 12:35:45,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-02-06 12:35:45,212 INFO L175 Difference]: Start difference. First operand has 52 places, 61 transitions, 282 flow. Second operand 3 states and 126 transitions. [2025-02-06 12:35:45,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 456 flow [2025-02-06 12:35:45,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 441 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:35:45,216 INFO L231 Difference]: Finished difference. Result has 52 places, 63 transitions, 311 flow [2025-02-06 12:35:45,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=52, PETRI_TRANSITIONS=63} [2025-02-06 12:35:45,217 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-02-06 12:35:45,217 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 63 transitions, 311 flow [2025-02-06 12:35:45,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 12:35:45,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:45,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:45,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:35:45,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:35:45,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:45,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1111338006, now seen corresponding path program 2 times [2025-02-06 12:35:45,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:45,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281191168] [2025-02-06 12:35:45,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:45,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:45,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:35:45,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:35:45,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:35:45,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:45,264 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 12:35:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:45,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281191168] [2025-02-06 12:35:45,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281191168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:45,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:45,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739269277] [2025-02-06 12:35:45,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:45,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:45,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:45,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:45,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:45,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-02-06 12:35:45,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 63 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:45,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:45,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-02-06 12:35:45,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:45,367 INFO L124 PetriNetUnfolderBase]: 402/788 cut-off events. [2025-02-06 12:35:45,367 INFO L125 PetriNetUnfolderBase]: For 1066/1111 co-relation queries the response was YES. [2025-02-06 12:35:45,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 788 events. 402/788 cut-off events. For 1066/1111 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3567 event pairs, 150 based on Foata normal form. 22/789 useless extension candidates. Maximal degree in co-relation 1251. Up to 335 conditions per place. [2025-02-06 12:35:45,370 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 47 selfloop transitions, 9 changer transitions 2/82 dead transitions. [2025-02-06 12:35:45,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 525 flow [2025-02-06 12:35:45,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-02-06 12:35:45,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7055555555555556 [2025-02-06 12:35:45,371 INFO L175 Difference]: Start difference. First operand has 52 places, 63 transitions, 311 flow. Second operand 3 states and 127 transitions. [2025-02-06 12:35:45,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 525 flow [2025-02-06 12:35:45,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:45,373 INFO L231 Difference]: Finished difference. Result has 54 places, 66 transitions, 367 flow [2025-02-06 12:35:45,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=54, PETRI_TRANSITIONS=66} [2025-02-06 12:35:45,373 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2025-02-06 12:35:45,373 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 66 transitions, 367 flow [2025-02-06 12:35:45,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:45,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:45,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:45,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:35:45,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:35:45,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:45,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1087608982, now seen corresponding path program 3 times [2025-02-06 12:35:45,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:45,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496055124] [2025-02-06 12:35:45,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:35:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:45,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:35:45,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:35:45,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:35:45,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:45,411 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 12:35:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496055124] [2025-02-06 12:35:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496055124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:45,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:45,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:35:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015930235] [2025-02-06 12:35:45,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:45,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:45,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:45,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:45,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-02-06 12:35:45,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 66 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 12:35:45,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:45,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-02-06 12:35:45,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:45,469 INFO L124 PetriNetUnfolderBase]: 334/679 cut-off events. [2025-02-06 12:35:45,469 INFO L125 PetriNetUnfolderBase]: For 1764/1826 co-relation queries the response was YES. [2025-02-06 12:35:45,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 679 events. 334/679 cut-off events. For 1764/1826 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3309 event pairs, 197 based on Foata normal form. 2/614 useless extension candidates. Maximal degree in co-relation 1190. Up to 480 conditions per place. [2025-02-06 12:35:45,472 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 0 selfloop transitions, 0 changer transitions 65/65 dead transitions. [2025-02-06 12:35:45,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 433 flow [2025-02-06 12:35:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-02-06 12:35:45,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-02-06 12:35:45,472 INFO L175 Difference]: Start difference. First operand has 54 places, 66 transitions, 367 flow. Second operand 3 states and 115 transitions. [2025-02-06 12:35:45,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 433 flow [2025-02-06 12:35:45,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:45,478 INFO L231 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2025-02-06 12:35:45,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=53, PETRI_TRANSITIONS=0} [2025-02-06 12:35:45,479 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2025-02-06 12:35:45,479 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 0 transitions, 0 flow [2025-02-06 12:35:45,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 12:35:45,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:35:45,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:35:45,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:35:45,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:35:45,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:35:45,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-06 12:35:45,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:35:45,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:35:45,485 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1] [2025-02-06 12:35:45,490 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:35:45,490 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:35:45,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:35:45 BasicIcfg [2025-02-06 12:35:45,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:35:45,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:35:45,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:35:45,499 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:35:45,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:43" (3/4) ... [2025-02-06 12:35:45,501 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 12:35:45,510 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-02-06 12:35:45,510 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-02-06 12:35:45,512 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-02-06 12:35:45,512 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-06 12:35:45,512 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 12:35:45,512 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 12:35:45,583 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 12:35:45,584 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 12:35:45,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:35:45,584 INFO L158 Benchmark]: Toolchain (without parser) took 2702.88ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 105.4MB in the beginning and 262.5MB in the end (delta: -157.1MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2025-02-06 12:35:45,584 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:35:45,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.00ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 86.0MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:35:45,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.64ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:35:45,587 INFO L158 Benchmark]: Boogie Preprocessor took 40.77ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 83.0MB in the end (delta: 920.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:35:45,587 INFO L158 Benchmark]: IcfgBuilder took 251.15ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 65.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:35:45,588 INFO L158 Benchmark]: TraceAbstraction took 1962.34ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 64.4MB in the beginning and 268.3MB in the end (delta: -203.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:35:45,588 INFO L158 Benchmark]: Witness Printer took 84.32ms. Allocated memory is still 343.9MB. Free memory was 268.3MB in the beginning and 262.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:35:45,589 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.00ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 86.0MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.64ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.77ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 83.0MB in the end (delta: 920.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 251.15ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 65.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1962.34ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 64.4MB in the beginning and 268.3MB in the end (delta: -203.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 84.32ms. Allocated memory is still 343.9MB. Free memory was 268.3MB in the beginning and 262.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 765]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 541 IncrementalHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 25 mSDtfsCounter, 541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=8, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 12:35:45,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE