./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-3.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/parallel-ticket-3.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 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:10:18,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:10:18,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:10:18,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:10:18,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:10:18,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:10:18,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:10:18,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:10:18,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:10:18,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:10:18,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:10:18,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:10:18,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:10:18,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:10:18,101 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:10:18,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:10:18,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:10:18,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:10:18,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:10:18,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:10:18,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:10:18,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:10:18,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:10:18,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:18,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:10:18,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:10:18,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:10:18,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:10:18,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:10:18,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:10:18,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:10:18,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:10:18,104 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 -> 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 [2025-03-04 10:10:18,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:10:18,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:10:18,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:10:18,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:10:18,325 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:10:18,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-03-04 10:10:19,430 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120cbb286/a2e63df96deb47fda22cb362e562ca38/FLAG81db2d62f [2025-03-04 10:10:19,697 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:10:19,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-03-04 10:10:19,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120cbb286/a2e63df96deb47fda22cb362e562ca38/FLAG81db2d62f [2025-03-04 10:10:20,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120cbb286/a2e63df96deb47fda22cb362e562ca38 [2025-03-04 10:10:20,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:10:20,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:10:20,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:20,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:10:20,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:10:20,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d59878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20, skipping insertion in model container [2025-03-04 10:10:20,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:10:20,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:20,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:10:20,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:20,199 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:10:20,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20 WrapperNode [2025-03-04 10:10:20,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:20,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:20,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:10:20,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:10:20,207 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:10:20" (1/1) ... [2025-03-04 10:10:20,212 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:10:20" (1/1) ... [2025-03-04 10:10:20,233 INFO L138 Inliner]: procedures = 19, calls = 15, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-04 10:10:20,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:20,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:10:20,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:10:20,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:10:20,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,261 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:10:20,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:10:20,277 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:10:20,277 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:10:20,277 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:10:20,277 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (1/1) ... [2025-03-04 10:10:20,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:20,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:20,303 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:10:20,309 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:10:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:10:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:10:20,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:10:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:10:20,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:10:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:10:20,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:10:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:10:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:10:20,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:10:20,327 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:10:20,396 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:10:20,397 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:10:20,575 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:10:20,575 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:10:20,686 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:10:20,688 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:10:20,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:20 BoogieIcfgContainer [2025-03-04 10:10:20,688 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:10:20,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:10:20,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:10:20,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:10:20,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:10:20" (1/3) ... [2025-03-04 10:10:20,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9196fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:20, skipping insertion in model container [2025-03-04 10:10:20,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:20" (2/3) ... [2025-03-04 10:10:20,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9196fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:20, skipping insertion in model container [2025-03-04 10:10:20,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:20" (3/3) ... [2025-03-04 10:10:20,697 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2025-03-04 10:10:20,707 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:10:20,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-3.wvr.c that has 4 procedures, 48 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 10:10:20,709 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:10:20,753 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:10:20,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 119 flow [2025-03-04 10:10:20,815 INFO L124 PetriNetUnfolderBase]: 2/46 cut-off events. [2025-03-04 10:10:20,817 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:10:20,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 2/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-03-04 10:10:20,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 49 transitions, 119 flow [2025-03-04 10:10:20,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 108 flow [2025-03-04 10:10:20,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:10:20,842 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;@3842c8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:10:20,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 10:10:20,854 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:10:20,855 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-04 10:10:20,855 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:10:20,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:20,855 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] [2025-03-04 10:10:20,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:10:20,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:20,861 INFO L85 PathProgramCache]: Analyzing trace with hash 684516842, now seen corresponding path program 1 times [2025-03-04 10:10:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726599745] [2025-03-04 10:10:20,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:20,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:10:20,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:10:20,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:20,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:21,164 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:10:21,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:21,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726599745] [2025-03-04 10:10:21,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726599745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:21,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:21,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158206585] [2025-03-04 10:10:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:21,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:21,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:21,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:21,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:21,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-03-04 10:10:21,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:10:21,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:21,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-03-04 10:10:21,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:21,512 INFO L124 PetriNetUnfolderBase]: 1948/3041 cut-off events. [2025-03-04 10:10:21,512 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-04 10:10:21,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6116 conditions, 3041 events. 1948/3041 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16168 event pairs, 858 based on Foata normal form. 2/2896 useless extension candidates. Maximal degree in co-relation 5673. Up to 1547 conditions per place. [2025-03-04 10:10:21,576 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 51 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2025-03-04 10:10:21,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 274 flow [2025-03-04 10:10:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-04 10:10:21,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6462585034013606 [2025-03-04 10:10:21,586 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 108 flow. Second operand 3 states and 95 transitions. [2025-03-04 10:10:21,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 274 flow [2025-03-04 10:10:21,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:10:21,594 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 117 flow [2025-03-04 10:10:21,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-03-04 10:10:21,599 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-03-04 10:10:21,599 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 117 flow [2025-03-04 10:10:21,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:10:21,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:21,600 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] [2025-03-04 10:10:21,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:10:21,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:10:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash 301438142, now seen corresponding path program 1 times [2025-03-04 10:10:21,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:21,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784847550] [2025-03-04 10:10:21,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:21,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:21,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:10:21,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:10:21,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:21,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:21,695 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:10:21,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:21,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784847550] [2025-03-04 10:10:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784847550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:21,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:21,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:21,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594521949] [2025-03-04 10:10:21,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:21,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:21,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:21,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:21,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 49 [2025-03-04 10:10:21,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:21,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:21,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 49 [2025-03-04 10:10:21,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:21,944 INFO L124 PetriNetUnfolderBase]: 2293/3505 cut-off events. [2025-03-04 10:10:21,944 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2025-03-04 10:10:21,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7425 conditions, 3505 events. 2293/3505 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17883 event pairs, 1673 based on Foata normal form. 0/3450 useless extension candidates. Maximal degree in co-relation 4808. Up to 3012 conditions per place. [2025-03-04 10:10:21,955 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 54 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-03-04 10:10:21,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 291 flow [2025-03-04 10:10:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 10:10:21,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2025-03-04 10:10:21,957 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 117 flow. Second operand 3 states and 83 transitions. [2025-03-04 10:10:21,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 291 flow [2025-03-04 10:10:21,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:21,960 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 156 flow [2025-03-04 10:10:21,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-03-04 10:10:21,960 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2025-03-04 10:10:21,961 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 156 flow [2025-03-04 10:10:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:21,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:21,961 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] [2025-03-04 10:10:21,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:10:21,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:10:21,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1660324812, now seen corresponding path program 1 times [2025-03-04 10:10:21,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:21,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647934485] [2025-03-04 10:10:21,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:21,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:10:21,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:10:21,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:21,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:22,116 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:10:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:22,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647934485] [2025-03-04 10:10:22,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647934485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:22,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:22,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:10:22,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965713055] [2025-03-04 10:10:22,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:22,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:22,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:22,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:22,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-03-04 10:10:22,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:10:22,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:22,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-03-04 10:10:22,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:22,550 INFO L124 PetriNetUnfolderBase]: 3201/5222 cut-off events. [2025-03-04 10:10:22,552 INFO L125 PetriNetUnfolderBase]: For 1671/1671 co-relation queries the response was YES. [2025-03-04 10:10:22,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11904 conditions, 5222 events. 3201/5222 cut-off events. For 1671/1671 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 32178 event pairs, 981 based on Foata normal form. 72/5237 useless extension candidates. Maximal degree in co-relation 7969. Up to 1990 conditions per place. [2025-03-04 10:10:22,573 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 81 selfloop transitions, 15 changer transitions 9/115 dead transitions. [2025-03-04 10:10:22,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 115 transitions, 558 flow [2025-03-04 10:10:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-03-04 10:10:22,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636734693877551 [2025-03-04 10:10:22,577 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 156 flow. Second operand 5 states and 156 transitions. [2025-03-04 10:10:22,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 115 transitions, 558 flow [2025-03-04 10:10:22,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 115 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:22,587 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 227 flow [2025-03-04 10:10:22,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2025-03-04 10:10:22,589 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-03-04 10:10:22,589 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 227 flow [2025-03-04 10:10:22,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:10:22,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:22,589 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] [2025-03-04 10:10:22,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:10:22,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:10:22,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1509713258, now seen corresponding path program 2 times [2025-03-04 10:10:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960455500] [2025-03-04 10:10:22,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:22,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:10:22,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:10:22,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:22,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:22,748 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:10:22,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:22,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960455500] [2025-03-04 10:10:22,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960455500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:22,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:22,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:10:22,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263725727] [2025-03-04 10:10:22,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:22,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:22,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:22,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:22,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:22,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-03-04 10:10:22,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:10:22,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:22,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-03-04 10:10:22,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:23,174 INFO L124 PetriNetUnfolderBase]: 2866/4823 cut-off events. [2025-03-04 10:10:23,174 INFO L125 PetriNetUnfolderBase]: For 2552/2554 co-relation queries the response was YES. [2025-03-04 10:10:23,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12452 conditions, 4823 events. 2866/4823 cut-off events. For 2552/2554 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 30296 event pairs, 837 based on Foata normal form. 74/4829 useless extension candidates. Maximal degree in co-relation 8543. Up to 1769 conditions per place. [2025-03-04 10:10:23,196 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 76 selfloop transitions, 17 changer transitions 13/116 dead transitions. [2025-03-04 10:10:23,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 116 transitions, 621 flow [2025-03-04 10:10:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-03-04 10:10:23,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-04 10:10:23,198 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 227 flow. Second operand 5 states and 154 transitions. [2025-03-04 10:10:23,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 116 transitions, 621 flow [2025-03-04 10:10:23,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 116 transitions, 621 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:10:23,202 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 291 flow [2025-03-04 10:10:23,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2025-03-04 10:10:23,202 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2025-03-04 10:10:23,202 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 291 flow [2025-03-04 10:10:23,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:10:23,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:23,203 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] [2025-03-04 10:10:23,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:10:23,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:10:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 309696254, now seen corresponding path program 3 times [2025-03-04 10:10:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804913560] [2025-03-04 10:10:23,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:10:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:23,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:10:23,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:10:23,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:10:23,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:23,349 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:10:23,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:23,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804913560] [2025-03-04 10:10:23,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804913560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:23,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:23,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:10:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411934553] [2025-03-04 10:10:23,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:23,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:10:23,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:23,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:10:23,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:10:23,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-03-04 10:10:23,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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:10:23,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:23,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-03-04 10:10:23,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:23,693 INFO L124 PetriNetUnfolderBase]: 1960/3369 cut-off events. [2025-03-04 10:10:23,693 INFO L125 PetriNetUnfolderBase]: For 3228/3228 co-relation queries the response was YES. [2025-03-04 10:10:23,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9560 conditions, 3369 events. 1960/3369 cut-off events. For 3228/3228 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20021 event pairs, 502 based on Foata normal form. 36/3363 useless extension candidates. Maximal degree in co-relation 8261. Up to 1473 conditions per place. [2025-03-04 10:10:23,708 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 62 selfloop transitions, 24 changer transitions 32/128 dead transitions. [2025-03-04 10:10:23,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 128 transitions, 786 flow [2025-03-04 10:10:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2025-03-04 10:10:23,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5782312925170068 [2025-03-04 10:10:23,712 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 291 flow. Second operand 6 states and 170 transitions. [2025-03-04 10:10:23,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 128 transitions, 786 flow [2025-03-04 10:10:23,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 128 transitions, 745 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:23,718 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 342 flow [2025-03-04 10:10:23,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2025-03-04 10:10:23,720 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-03-04 10:10:23,721 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 342 flow [2025-03-04 10:10:23,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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:10:23,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:23,722 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] [2025-03-04 10:10:23,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:10:23,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:10:23,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1953890252, now seen corresponding path program 4 times [2025-03-04 10:10:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:23,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737981299] [2025-03-04 10:10:23,723 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:10:23,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:23,734 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-04 10:10:23,747 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:10:23,747 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:10:23,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:23,935 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:10:23,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:23,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737981299] [2025-03-04 10:10:23,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737981299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:23,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:23,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:10:23,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265377296] [2025-03-04 10:10:23,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:23,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:10:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:23,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:10:23,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:10:23,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-03-04 10:10:23,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 342 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:10:23,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:23,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-03-04 10:10:23,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:24,210 INFO L124 PetriNetUnfolderBase]: 980/1724 cut-off events. [2025-03-04 10:10:24,210 INFO L125 PetriNetUnfolderBase]: For 1708/1708 co-relation queries the response was YES. [2025-03-04 10:10:24,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5128 conditions, 1724 events. 980/1724 cut-off events. For 1708/1708 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8908 event pairs, 319 based on Foata normal form. 32/1731 useless extension candidates. Maximal degree in co-relation 1957. Up to 634 conditions per place. [2025-03-04 10:10:24,219 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 57 selfloop transitions, 20 changer transitions 24/111 dead transitions. [2025-03-04 10:10:24,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 111 transitions, 710 flow [2025-03-04 10:10:24,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2025-03-04 10:10:24,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49744897959183676 [2025-03-04 10:10:24,221 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 342 flow. Second operand 8 states and 195 transitions. [2025-03-04 10:10:24,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 111 transitions, 710 flow [2025-03-04 10:10:24,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 688 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:24,225 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 331 flow [2025-03-04 10:10:24,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=331, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2025-03-04 10:10:24,226 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2025-03-04 10:10:24,226 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 331 flow [2025-03-04 10:10:24,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:10:24,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:24,227 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] [2025-03-04 10:10:24,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:10:24,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:10:24,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1358509412, now seen corresponding path program 5 times [2025-03-04 10:10:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488202071] [2025-03-04 10:10:24,228 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:10:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:24,233 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:10:24,238 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:10:24,238 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:24,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:24,315 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:10:24,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:24,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488202071] [2025-03-04 10:10:24,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488202071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:24,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:24,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:10:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341505239] [2025-03-04 10:10:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:24,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:10:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:24,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:10:24,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:10:24,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-03-04 10:10:24,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 331 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:10:24,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:24,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-03-04 10:10:24,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:24,528 INFO L124 PetriNetUnfolderBase]: 675/1213 cut-off events. [2025-03-04 10:10:24,528 INFO L125 PetriNetUnfolderBase]: For 1984/1984 co-relation queries the response was YES. [2025-03-04 10:10:24,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1213 events. 675/1213 cut-off events. For 1984/1984 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5751 event pairs, 228 based on Foata normal form. 16/1216 useless extension candidates. Maximal degree in co-relation 1897. Up to 404 conditions per place. [2025-03-04 10:10:24,533 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 50 selfloop transitions, 14 changer transitions 25/97 dead transitions. [2025-03-04 10:10:24,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 97 transitions, 652 flow [2025-03-04 10:10:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2025-03-04 10:10:24,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2025-03-04 10:10:24,534 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 331 flow. Second operand 8 states and 184 transitions. [2025-03-04 10:10:24,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 97 transitions, 652 flow [2025-03-04 10:10:24,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 594 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-03-04 10:10:24,537 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 252 flow [2025-03-04 10:10:24,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2025-03-04 10:10:24,538 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2025-03-04 10:10:24,538 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 252 flow [2025-03-04 10:10:24,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:10:24,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:24,538 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] [2025-03-04 10:10:24,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:10:24,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:10:24,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash -779619570, now seen corresponding path program 2 times [2025-03-04 10:10:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:24,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706806083] [2025-03-04 10:10:24,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:24,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:10:24,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:10:24,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:24,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:24,628 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:10:24,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706806083] [2025-03-04 10:10:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706806083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:24,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:10:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843202899] [2025-03-04 10:10:24,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:24,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:10:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:24,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:10:24,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:10:24,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-03-04 10:10:24,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:10:24,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:24,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-03-04 10:10:24,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:24,761 INFO L124 PetriNetUnfolderBase]: 185/377 cut-off events. [2025-03-04 10:10:24,761 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2025-03-04 10:10:24,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 377 events. 185/377 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1300 event pairs, 60 based on Foata normal form. 32/406 useless extension candidates. Maximal degree in co-relation 707. Up to 125 conditions per place. [2025-03-04 10:10:24,762 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2025-03-04 10:10:24,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 430 flow [2025-03-04 10:10:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2025-03-04 10:10:24,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2025-03-04 10:10:24,763 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 252 flow. Second operand 8 states and 161 transitions. [2025-03-04 10:10:24,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 430 flow [2025-03-04 10:10:24,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 359 flow, removed 7 selfloop flow, removed 12 redundant places. [2025-03-04 10:10:24,765 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-03-04 10:10:24,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-03-04 10:10:24,766 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2025-03-04 10:10:24,766 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-03-04 10:10:24,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:10:24,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-03-04 10:10:24,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-04 10:10:24,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-04 10:10:24,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-04 10:10:24,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-04 10:10:24,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:10:24,770 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1] [2025-03-04 10:10:24,773 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:10:24,774 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:10:24,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:10:24 BasicIcfg [2025-03-04 10:10:24,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:10:24,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:10:24,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:10:24,778 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:10:24,779 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:20" (3/4) ... [2025-03-04 10:10:24,780 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:10:24,782 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 10:10:24,783 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 10:10:24,783 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 10:10:24,786 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-04 10:10:24,786 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 10:10:24,787 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 10:10:24,787 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 10:10:24,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:10:24,847 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:10:24,847 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:10:24,848 INFO L158 Benchmark]: Toolchain (without parser) took 4838.14ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 132.8MB in the beginning and 256.1MB in the end (delta: -123.2MB). Peak memory consumption was 197.8MB. Max. memory is 16.1GB. [2025-03-04 10:10:24,848 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:10:24,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.60ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 121.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:10:24,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.75ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:10:24,848 INFO L158 Benchmark]: Boogie Preprocessor took 41.35ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 118.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:10:24,849 INFO L158 Benchmark]: IcfgBuilder took 411.90ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 88.7MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:10:24,849 INFO L158 Benchmark]: TraceAbstraction took 4087.02ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 87.8MB in the beginning and 86.4MB in the end (delta: 1.4MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. [2025-03-04 10:10:24,849 INFO L158 Benchmark]: Witness Printer took 69.06ms. Allocated memory is still 310.4MB. Free memory was 86.4MB in the beginning and 256.1MB in the end (delta: -169.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:10:24,850 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.60ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 121.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.75ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.35ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 118.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 411.90ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 88.7MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4087.02ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 87.8MB in the beginning and 86.4MB in the end (delta: 1.4MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. * Witness Printer took 69.06ms. Allocated memory is still 310.4MB. Free memory was 86.4MB in the beginning and 256.1MB in the end (delta: -169.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 71]: 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 7 procedures, 75 locations, 5 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: 4.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1394 IncrementalHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 4 mSDtfsCounter, 1394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=5, InterpolantAutomatonStates: 46, 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, 1.0s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 10:10:24,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE