./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/test-easy10.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/test-easy10.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:17:05,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:17:05,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:17:05,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:17:05,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:17:05,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:17:05,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:17:05,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:17:05,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:17:05,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:17:05,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:17:05,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:17:05,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:17:05,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:17:05,114 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:17:05,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:17:05,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:17:05,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:17:05,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:17:05,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:17:05,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:17:05,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:17:05,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:17:05,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:17:05,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:17:05,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:17:05,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:17:05,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:17:05,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:17:05,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:17:05,117 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 [2025-03-04 10:17:05,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:17:05,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:17:05,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:17:05,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:17:05,357 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:17:05,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy10.wvr.c [2025-03-04 10:17:06,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1712923e/3fdc135904bd41049d0d297a831b4968/FLAG6a6419ff7 [2025-03-04 10:17:06,707 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:17:06,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy10.wvr.c [2025-03-04 10:17:06,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1712923e/3fdc135904bd41049d0d297a831b4968/FLAG6a6419ff7 [2025-03-04 10:17:06,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1712923e/3fdc135904bd41049d0d297a831b4968 [2025-03-04 10:17:06,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:17:06,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:17:06,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:17:06,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:17:06,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:17:06,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db2c4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06, skipping insertion in model container [2025-03-04 10:17:06,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:17:06,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:17:06,892 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:17:06,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:17:06,929 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:17:06,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06 WrapperNode [2025-03-04 10:17:06,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:17:06,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:17:06,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:17:06,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:17:06,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,959 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 149 [2025-03-04 10:17:06,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:17:06,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:17:06,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:17:06,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:17:06,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:17:06,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:17:06,988 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:17:06,988 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:17:06,988 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:17:06,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (1/1) ... [2025-03-04 10:17:06,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:17:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:07,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:17:07,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:17:07,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:17:07,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:17:07,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:17:07,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:17:07,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:17:07,029 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:17:07,101 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:17:07,102 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:17:07,305 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:17:07,307 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:17:07,427 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:17:07,427 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:17:07,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:17:07 BoogieIcfgContainer [2025-03-04 10:17:07,428 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:17:07,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:17:07,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:17:07,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:17:07,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:17:06" (1/3) ... [2025-03-04 10:17:07,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e23f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:17:07, skipping insertion in model container [2025-03-04 10:17:07,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:06" (2/3) ... [2025-03-04 10:17:07,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e23f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:17:07, skipping insertion in model container [2025-03-04 10:17:07,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:17:07" (3/3) ... [2025-03-04 10:17:07,435 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2025-03-04 10:17:07,445 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:17:07,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy10.wvr.c that has 5 procedures, 63 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 10:17:07,447 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:17:07,491 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:17:07,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 62 transitions, 152 flow [2025-03-04 10:17:07,552 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-03-04 10:17:07,554 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:17:07,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 0/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 10:17:07,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 62 transitions, 152 flow [2025-03-04 10:17:07,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 57 transitions, 138 flow [2025-03-04 10:17:07,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:17:07,574 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;@4ba27c4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:17:07,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:17:07,594 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:17:07,594 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-03-04 10:17:07,594 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:17:07,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:07,595 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, 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-03-04 10:17:07,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:17:07,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2073192136, now seen corresponding path program 1 times [2025-03-04 10:17:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389319090] [2025-03-04 10:17:07,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:07,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:17:07,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:17:07,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:07,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:08,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:08,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389319090] [2025-03-04 10:17:08,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389319090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:08,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:08,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:17:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564095935] [2025-03-04 10:17:08,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:08,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:17:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:08,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:17:08,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:17:08,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-03-04 10:17:08,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:08,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:08,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-03-04 10:17:08,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:09,761 INFO L124 PetriNetUnfolderBase]: 22838/30875 cut-off events. [2025-03-04 10:17:09,763 INFO L125 PetriNetUnfolderBase]: For 843/843 co-relation queries the response was YES. [2025-03-04 10:17:09,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63061 conditions, 30875 events. 22838/30875 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 170782 event pairs, 7169 based on Foata normal form. 441/31281 useless extension candidates. Maximal degree in co-relation 59981. Up to 24496 conditions per place. [2025-03-04 10:17:09,973 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 70 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-03-04 10:17:09,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 328 flow [2025-03-04 10:17:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-04 10:17:09,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2025-03-04 10:17:09,986 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 138 flow. Second operand 3 states and 104 transitions. [2025-03-04 10:17:09,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 328 flow [2025-03-04 10:17:10,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 308 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:17:10,058 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 126 flow [2025-03-04 10:17:10,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-03-04 10:17:10,063 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2025-03-04 10:17:10,064 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 126 flow [2025-03-04 10:17:10,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:10,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:10,064 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, 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-03-04 10:17:10,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:17:10,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:17:10,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:10,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1748958036, now seen corresponding path program 2 times [2025-03-04 10:17:10,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:10,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497013494] [2025-03-04 10:17:10,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:10,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:10,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:17:10,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:17:10,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:10,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497013494] [2025-03-04 10:17:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497013494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:10,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:10,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:17:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127532025] [2025-03-04 10:17:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:10,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:17:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:10,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:17:10,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:17:10,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-03-04 10:17:10,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:10,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:10,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-03-04 10:17:10,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:11,276 INFO L124 PetriNetUnfolderBase]: 17539/23837 cut-off events. [2025-03-04 10:17:11,276 INFO L125 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2025-03-04 10:17:11,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49392 conditions, 23837 events. 17539/23837 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 123609 event pairs, 6369 based on Foata normal form. 434/24228 useless extension candidates. Maximal degree in co-relation 17479. Up to 17342 conditions per place. [2025-03-04 10:17:11,444 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 68 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-04 10:17:11,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 313 flow [2025-03-04 10:17:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-04 10:17:11,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543010752688172 [2025-03-04 10:17:11,445 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 126 flow. Second operand 3 states and 101 transitions. [2025-03-04 10:17:11,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 313 flow [2025-03-04 10:17:11,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 75 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:11,448 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 130 flow [2025-03-04 10:17:11,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-04 10:17:11,448 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2025-03-04 10:17:11,449 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 130 flow [2025-03-04 10:17:11,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:11,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:11,449 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, 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-03-04 10:17:11,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:17:11,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:17:11,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash -429923894, now seen corresponding path program 3 times [2025-03-04 10:17:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:11,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047341987] [2025-03-04 10:17:11,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:17:11,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:11,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:17:11,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:17:11,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:17:11,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047341987] [2025-03-04 10:17:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047341987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:13,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 10:17:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917365058] [2025-03-04 10:17:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:13,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:17:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:13,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:17:13,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:17:13,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-03-04 10:17:13,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 130 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:13,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:13,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-03-04 10:17:13,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:16,964 INFO L124 PetriNetUnfolderBase]: 43818/60147 cut-off events. [2025-03-04 10:17:16,965 INFO L125 PetriNetUnfolderBase]: For 4618/4618 co-relation queries the response was YES. [2025-03-04 10:17:17,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127496 conditions, 60147 events. 43818/60147 cut-off events. For 4618/4618 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 364938 event pairs, 5303 based on Foata normal form. 1/60125 useless extension candidates. Maximal degree in co-relation 25744. Up to 14408 conditions per place. [2025-03-04 10:17:17,170 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 251 selfloop transitions, 16 changer transitions 19/291 dead transitions. [2025-03-04 10:17:17,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 291 transitions, 1271 flow [2025-03-04 10:17:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:17:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:17:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 437 transitions. [2025-03-04 10:17:17,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4698924731182796 [2025-03-04 10:17:17,177 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 130 flow. Second operand 15 states and 437 transitions. [2025-03-04 10:17:17,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 291 transitions, 1271 flow [2025-03-04 10:17:17,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 291 transitions, 1251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:17,202 INFO L231 Difference]: Finished difference. Result has 89 places, 69 transitions, 250 flow [2025-03-04 10:17:17,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=250, PETRI_PLACES=89, PETRI_TRANSITIONS=69} [2025-03-04 10:17:17,204 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2025-03-04 10:17:17,204 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 69 transitions, 250 flow [2025-03-04 10:17:17,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:17,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:17,204 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, 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-03-04 10:17:17,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:17:17,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:17:17,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash 441856100, now seen corresponding path program 4 times [2025-03-04 10:17:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:17,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345853741] [2025-03-04 10:17:17,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:17:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:17,214 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-04 10:17:17,220 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:17:17,220 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:17:17,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:17,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:17,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345853741] [2025-03-04 10:17:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345853741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:17,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:17:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703643325] [2025-03-04 10:17:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:17,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:17:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:17,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:17:17,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:17:17,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-03-04 10:17:17,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 69 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:17,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:17,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-03-04 10:17:17,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:19,352 INFO L124 PetriNetUnfolderBase]: 35366/48902 cut-off events. [2025-03-04 10:17:19,352 INFO L125 PetriNetUnfolderBase]: For 33403/33403 co-relation queries the response was YES. [2025-03-04 10:17:19,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131387 conditions, 48902 events. 35366/48902 cut-off events. For 33403/33403 co-relation queries the response was YES. Maximal size of possible extension queue 1037. Compared 291087 event pairs, 14368 based on Foata normal form. 540/49409 useless extension candidates. Maximal degree in co-relation 131342. Up to 42949 conditions per place. [2025-03-04 10:17:19,601 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 86 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-03-04 10:17:19,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 503 flow [2025-03-04 10:17:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-04 10:17:19,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2025-03-04 10:17:19,603 INFO L175 Difference]: Start difference. First operand has 89 places, 69 transitions, 250 flow. Second operand 3 states and 105 transitions. [2025-03-04 10:17:19,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 503 flow [2025-03-04 10:17:20,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 93 transitions, 487 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 10:17:20,091 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 234 flow [2025-03-04 10:17:20,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2025-03-04 10:17:20,091 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 15 predicate places. [2025-03-04 10:17:20,092 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 234 flow [2025-03-04 10:17:20,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:20,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:20,092 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, 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-03-04 10:17:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:17:20,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:17:20,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2108773478, now seen corresponding path program 5 times [2025-03-04 10:17:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633305820] [2025-03-04 10:17:20,093 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:17:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:20,099 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:17:20,135 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:17:20,136 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:20,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:21,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633305820] [2025-03-04 10:17:21,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633305820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:21,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:21,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 10:17:21,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784213295] [2025-03-04 10:17:21,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:21,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:17:21,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:21,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:17:21,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:17:21,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-03-04 10:17:21,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 234 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:21,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:21,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-03-04 10:17:21,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:26,823 INFO L124 PetriNetUnfolderBase]: 65121/91304 cut-off events. [2025-03-04 10:17:26,823 INFO L125 PetriNetUnfolderBase]: For 52925/52925 co-relation queries the response was YES. [2025-03-04 10:17:27,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239409 conditions, 91304 events. 65121/91304 cut-off events. For 52925/52925 co-relation queries the response was YES. Maximal size of possible extension queue 2105. Compared 601414 event pairs, 9909 based on Foata normal form. 1/91278 useless extension candidates. Maximal degree in co-relation 181201. Up to 28006 conditions per place. [2025-03-04 10:17:27,274 INFO L140 encePairwiseOnDemand]: 46/62 looper letters, 290 selfloop transitions, 27 changer transitions 10/332 dead transitions. [2025-03-04 10:17:27,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 332 transitions, 1834 flow [2025-03-04 10:17:27,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:17:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:17:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 431 transitions. [2025-03-04 10:17:27,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46344086021505376 [2025-03-04 10:17:27,276 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 234 flow. Second operand 15 states and 431 transitions. [2025-03-04 10:17:27,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 332 transitions, 1834 flow [2025-03-04 10:17:27,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 332 transitions, 1814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:27,869 INFO L231 Difference]: Finished difference. Result has 109 places, 88 transitions, 482 flow [2025-03-04 10:17:27,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=482, PETRI_PLACES=109, PETRI_TRANSITIONS=88} [2025-03-04 10:17:27,870 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 39 predicate places. [2025-03-04 10:17:27,870 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 88 transitions, 482 flow [2025-03-04 10:17:27,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:27,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:27,873 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, 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-03-04 10:17:27,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:17:27,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:17:27,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:27,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1512937002, now seen corresponding path program 6 times [2025-03-04 10:17:27,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:27,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272795831] [2025-03-04 10:17:27,873 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:17:27,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:27,880 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:17:27,921 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:17:27,922 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:17:27,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272795831] [2025-03-04 10:17:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272795831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:28,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:28,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 10:17:28,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977887610] [2025-03-04 10:17:28,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:28,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:17:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:28,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:17:28,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:17:28,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-03-04 10:17:28,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 88 transitions, 482 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:28,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:28,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-03-04 10:17:28,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:38,048 INFO L124 PetriNetUnfolderBase]: 95501/134922 cut-off events. [2025-03-04 10:17:38,048 INFO L125 PetriNetUnfolderBase]: For 206860/206860 co-relation queries the response was YES. [2025-03-04 10:17:38,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410357 conditions, 134922 events. 95501/134922 cut-off events. For 206860/206860 co-relation queries the response was YES. Maximal size of possible extension queue 3112. Compared 945014 event pairs, 15614 based on Foata normal form. 1/134900 useless extension candidates. Maximal degree in co-relation 410009. Up to 36303 conditions per place. [2025-03-04 10:17:39,008 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 310 selfloop transitions, 47 changer transitions 11/373 dead transitions. [2025-03-04 10:17:39,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 373 transitions, 2595 flow [2025-03-04 10:17:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:17:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:17:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 428 transitions. [2025-03-04 10:17:39,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46021505376344085 [2025-03-04 10:17:39,011 INFO L175 Difference]: Start difference. First operand has 109 places, 88 transitions, 482 flow. Second operand 15 states and 428 transitions. [2025-03-04 10:17:39,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 373 transitions, 2595 flow [2025-03-04 10:17:43,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 373 transitions, 2557 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-04 10:17:43,077 INFO L231 Difference]: Finished difference. Result has 131 places, 120 transitions, 976 flow [2025-03-04 10:17:43,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=976, PETRI_PLACES=131, PETRI_TRANSITIONS=120} [2025-03-04 10:17:43,078 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 61 predicate places. [2025-03-04 10:17:43,078 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 120 transitions, 976 flow [2025-03-04 10:17:43,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:43,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:43,078 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, 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-03-04 10:17:43,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:17:43,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:17:43,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 54376220, now seen corresponding path program 7 times [2025-03-04 10:17:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939731531] [2025-03-04 10:17:43,079 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:17:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:43,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:17:43,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:17:43,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:43,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:44,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:44,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939731531] [2025-03-04 10:17:44,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939731531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:44,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:44,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 10:17:44,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113639131] [2025-03-04 10:17:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:44,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:17:44,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:44,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:17:44,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:17:44,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-03-04 10:17:44,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 120 transitions, 976 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:44,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:44,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-03-04 10:17:44,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand