./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3-extended.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-misc-3-extended.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 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:09:43,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:09:43,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:09:43,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:09:43,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:09:43,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:09:43,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:09:43,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:09:43,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:09:43,631 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:09:43,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:09:43,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:09:43,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:09:43,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:09:43,632 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:09:43,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:09:43,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:09:43,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:09:43,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:09:43,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:09:43,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:09:43,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:09:43,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:09:43,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:09:43,635 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 -> 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f [2025-03-04 10:09:43,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:09:43,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:09:43,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:09:43,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:09:43,846 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:09:43,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-04 10:09:44,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84cf9e9e3/a3e8724e15c54d4ebdf3115e9db4f784/FLAGa6cfa4148 [2025-03-04 10:09:45,172 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:09:45,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-04 10:09:45,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84cf9e9e3/a3e8724e15c54d4ebdf3115e9db4f784/FLAGa6cfa4148 [2025-03-04 10:09:45,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84cf9e9e3/a3e8724e15c54d4ebdf3115e9db4f784 [2025-03-04 10:09:45,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:09:45,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:09:45,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:09:45,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:09:45,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:09:45,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1422b056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45, skipping insertion in model container [2025-03-04 10:09:45,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:09:45,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:09:45,668 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:09:45,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:09:45,700 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:09:45,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45 WrapperNode [2025-03-04 10:09:45,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:09:45,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:09:45,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:09:45,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:09:45,707 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:09:45" (1/1) ... [2025-03-04 10:09:45,716 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:09:45" (1/1) ... [2025-03-04 10:09:45,727 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2025-03-04 10:09:45,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:09:45,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:09:45,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:09:45,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:09:45,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,750 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:09:45,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:09:45,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:09:45,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:09:45,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:09:45,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (1/1) ... [2025-03-04 10:09:45,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:09:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:45,790 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:09:45,793 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:09:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:09:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:09:45,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:09:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:09:45,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:09:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:09:45,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:09:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:09:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:09:45,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:09:45,811 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:09:45,876 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:09:45,877 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:09:46,033 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:09:46,033 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:09:46,136 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:09:46,136 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:09:46,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:09:46 BoogieIcfgContainer [2025-03-04 10:09:46,136 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:09:46,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:09:46,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:09:46,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:09:46,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:09:45" (1/3) ... [2025-03-04 10:09:46,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a447a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:09:46, skipping insertion in model container [2025-03-04 10:09:46,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:45" (2/3) ... [2025-03-04 10:09:46,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a447a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:09:46, skipping insertion in model container [2025-03-04 10:09:46,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:09:46" (3/3) ... [2025-03-04 10:09:46,144 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-03-04 10:09:46,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:09:46,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 39 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-04 10:09:46,158 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:09:46,206 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:09:46,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 109 flow [2025-03-04 10:09:46,264 INFO L124 PetriNetUnfolderBase]: 6/41 cut-off events. [2025-03-04 10:09:46,266 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:09:46,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 6/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-04 10:09:46,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 44 transitions, 109 flow [2025-03-04 10:09:46,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 40 transitions, 98 flow [2025-03-04 10:09:46,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:09:46,292 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;@589d398f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:09:46,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 10:09:46,303 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:09:46,303 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2025-03-04 10:09:46,303 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:09:46,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:46,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:46,305 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:09:46,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1453559304, now seen corresponding path program 1 times [2025-03-04 10:09:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:46,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582540861] [2025-03-04 10:09:46,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:46,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:09:46,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:09:46,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:46,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:46,537 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:09:46,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:46,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582540861] [2025-03-04 10:09:46,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582540861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:46,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:46,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:09:46,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131371378] [2025-03-04 10:09:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:46,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:46,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:46,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:46,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-04 10:09:46,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:09:46,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:46,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-04 10:09:46,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:46,840 INFO L124 PetriNetUnfolderBase]: 996/1607 cut-off events. [2025-03-04 10:09:46,841 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-04 10:09:46,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1607 events. 996/1607 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8034 event pairs, 94 based on Foata normal form. 2/1448 useless extension candidates. Maximal degree in co-relation 2669. Up to 1177 conditions per place. [2025-03-04 10:09:46,856 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 32 selfloop transitions, 7 changer transitions 1/55 dead transitions. [2025-03-04 10:09:46,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 223 flow [2025-03-04 10:09:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-04 10:09:46,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 10:09:46,869 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 98 flow. Second operand 3 states and 99 transitions. [2025-03-04 10:09:46,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 223 flow [2025-03-04 10:09:46,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:46,879 INFO L231 Difference]: Finished difference. Result has 39 places, 44 transitions, 129 flow [2025-03-04 10:09:46,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=39, PETRI_TRANSITIONS=44} [2025-03-04 10:09:46,885 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-03-04 10:09:46,885 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 44 transitions, 129 flow [2025-03-04 10:09:46,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:09:46,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:46,886 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] [2025-03-04 10:09:46,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:09:46,887 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:09:46,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:46,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1539406788, now seen corresponding path program 1 times [2025-03-04 10:09:46,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:46,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74827774] [2025-03-04 10:09:46,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:46,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:09:46,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:09:46,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:46,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:47,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:47,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74827774] [2025-03-04 10:09:47,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74827774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:47,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:47,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:09:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163495593] [2025-03-04 10:09:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:47,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:47,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:47,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:47,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:47,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-04 10:09:47,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 44 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:09:47,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:47,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-04 10:09:47,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:47,197 INFO L124 PetriNetUnfolderBase]: 1150/1837 cut-off events. [2025-03-04 10:09:47,198 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2025-03-04 10:09:47,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 1837 events. 1150/1837 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9729 event pairs, 142 based on Foata normal form. 49/1686 useless extension candidates. Maximal degree in co-relation 2850. Up to 900 conditions per place. [2025-03-04 10:09:47,209 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 43 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-04 10:09:47,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 265 flow [2025-03-04 10:09:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-04 10:09:47,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2025-03-04 10:09:47,210 INFO L175 Difference]: Start difference. First operand has 39 places, 44 transitions, 129 flow. Second operand 3 states and 97 transitions. [2025-03-04 10:09:47,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 265 flow [2025-03-04 10:09:47,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 256 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:47,212 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 132 flow [2025-03-04 10:09:47,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2025-03-04 10:09:47,212 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2025-03-04 10:09:47,213 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 132 flow [2025-03-04 10:09:47,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:09:47,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:47,213 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] [2025-03-04 10:09:47,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:09:47,213 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:09:47,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash -687277150, now seen corresponding path program 1 times [2025-03-04 10:09:47,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:47,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379427630] [2025-03-04 10:09:47,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:47,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:47,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:09:47,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:09:47,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:47,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:47,298 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:09:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379427630] [2025-03-04 10:09:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379427630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:47,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:47,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:09:47,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652502077] [2025-03-04 10:09:47,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:47,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:47,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:47,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:47,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-04 10:09:47,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:09:47,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:47,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-04 10:09:47,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:47,511 INFO L124 PetriNetUnfolderBase]: 1223/1996 cut-off events. [2025-03-04 10:09:47,511 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2025-03-04 10:09:47,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 1996 events. 1223/1996 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11133 event pairs, 198 based on Foata normal form. 71/1802 useless extension candidates. Maximal degree in co-relation 2690. Up to 1041 conditions per place. [2025-03-04 10:09:47,526 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 44 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-03-04 10:09:47,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 277 flow [2025-03-04 10:09:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-04 10:09:47,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-04 10:09:47,529 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 132 flow. Second operand 3 states and 96 transitions. [2025-03-04 10:09:47,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 277 flow [2025-03-04 10:09:47,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:47,531 INFO L231 Difference]: Finished difference. Result has 43 places, 46 transitions, 142 flow [2025-03-04 10:09:47,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=43, PETRI_TRANSITIONS=46} [2025-03-04 10:09:47,532 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-03-04 10:09:47,532 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 142 flow [2025-03-04 10:09:47,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:09:47,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:47,532 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] [2025-03-04 10:09:47,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:09:47,532 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:09:47,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1674446536, now seen corresponding path program 1 times [2025-03-04 10:09:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:47,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574156994] [2025-03-04 10:09:47,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:47,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:47,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:09:47,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:09:47,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:47,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:47,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:47,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574156994] [2025-03-04 10:09:47,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574156994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:47,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:47,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:09:47,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943445979] [2025-03-04 10:09:47,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:47,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:47,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:47,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:47,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:47,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-04 10:09:47,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:09:47,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:47,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-04 10:09:47,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:47,862 INFO L124 PetriNetUnfolderBase]: 1417/2320 cut-off events. [2025-03-04 10:09:47,863 INFO L125 PetriNetUnfolderBase]: For 1118/1118 co-relation queries the response was YES. [2025-03-04 10:09:47,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5704 conditions, 2320 events. 1417/2320 cut-off events. For 1118/1118 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13301 event pairs, 321 based on Foata normal form. 64/2116 useless extension candidates. Maximal degree in co-relation 2133. Up to 1031 conditions per place. [2025-03-04 10:09:47,879 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 45 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-03-04 10:09:47,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 295 flow [2025-03-04 10:09:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-04 10:09:47,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2025-03-04 10:09:47,880 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 142 flow. Second operand 3 states and 95 transitions. [2025-03-04 10:09:47,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 295 flow [2025-03-04 10:09:47,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:47,882 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 152 flow [2025-03-04 10:09:47,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2025-03-04 10:09:47,883 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-03-04 10:09:47,883 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 152 flow [2025-03-04 10:09:47,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:09:47,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:47,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:47,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:09:47,884 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:09:47,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash -365850938, now seen corresponding path program 1 times [2025-03-04 10:09:47,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:47,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370815789] [2025-03-04 10:09:47,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:47,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:47,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:09:47,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:09:47,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:47,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:48,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370815789] [2025-03-04 10:09:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370815789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:48,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:09:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45920912] [2025-03-04 10:09:48,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:48,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:48,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:48,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:48,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2025-03-04 10:09:48,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:09:48,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:48,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2025-03-04 10:09:48,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:48,223 INFO L124 PetriNetUnfolderBase]: 1557/2448 cut-off events. [2025-03-04 10:09:48,223 INFO L125 PetriNetUnfolderBase]: For 1225/1225 co-relation queries the response was YES. [2025-03-04 10:09:48,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6364 conditions, 2448 events. 1557/2448 cut-off events. For 1225/1225 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13809 event pairs, 321 based on Foata normal form. 48/2360 useless extension candidates. Maximal degree in co-relation 2398. Up to 1323 conditions per place. [2025-03-04 10:09:48,234 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 44 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-04 10:09:48,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 292 flow [2025-03-04 10:09:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2025-03-04 10:09:48,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2025-03-04 10:09:48,236 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 152 flow. Second operand 3 states and 92 transitions. [2025-03-04 10:09:48,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 292 flow [2025-03-04 10:09:48,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:48,238 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 154 flow [2025-03-04 10:09:48,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2025-03-04 10:09:48,239 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-03-04 10:09:48,239 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 154 flow [2025-03-04 10:09:48,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:09:48,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:48,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:48,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:09:48,239 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:09:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash -201530650, now seen corresponding path program 1 times [2025-03-04 10:09:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:48,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809260596] [2025-03-04 10:09:48,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:48,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:09:48,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:09:48,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:48,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:48,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:48,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809260596] [2025-03-04 10:09:48,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809260596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:48,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:48,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970532119] [2025-03-04 10:09:48,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:48,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:48,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:48,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:48,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2025-03-04 10:09:48,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:09:48,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:48,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2025-03-04 10:09:48,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:48,706 INFO L124 PetriNetUnfolderBase]: 2730/4169 cut-off events. [2025-03-04 10:09:48,707 INFO L125 PetriNetUnfolderBase]: For 2221/2277 co-relation queries the response was YES. [2025-03-04 10:09:48,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10885 conditions, 4169 events. 2730/4169 cut-off events. For 2221/2277 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23171 event pairs, 492 based on Foata normal form. 62/4017 useless extension candidates. Maximal degree in co-relation 4550. Up to 1624 conditions per place. [2025-03-04 10:09:48,728 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 64 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-03-04 10:09:48,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 420 flow [2025-03-04 10:09:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-03-04 10:09:48,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-04 10:09:48,730 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 154 flow. Second operand 4 states and 128 transitions. [2025-03-04 10:09:48,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 420 flow [2025-03-04 10:09:48,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:48,734 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 182 flow [2025-03-04 10:09:48,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-03-04 10:09:48,735 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2025-03-04 10:09:48,735 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 182 flow [2025-03-04 10:09:48,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:09:48,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:48,735 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:48,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:09:48,735 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:09:48,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash -818889815, now seen corresponding path program 1 times [2025-03-04 10:09:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:48,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065603537] [2025-03-04 10:09:48,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:48,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:09:48,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:09:48,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:48,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:48,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065603537] [2025-03-04 10:09:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065603537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:48,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:48,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:48,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699834618] [2025-03-04 10:09:48,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:48,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:48,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:48,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:48,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:48,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2025-03-04 10:09:48,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:09:48,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:48,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2025-03-04 10:09:48,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:49,321 INFO L124 PetriNetUnfolderBase]: 4180/6087 cut-off events. [2025-03-04 10:09:49,322 INFO L125 PetriNetUnfolderBase]: For 5634/6118 co-relation queries the response was YES. [2025-03-04 10:09:49,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17655 conditions, 6087 events. 4180/6087 cut-off events. For 5634/6118 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 35116 event pairs, 1044 based on Foata normal form. 269/6020 useless extension candidates. Maximal degree in co-relation 9714. Up to 2315 conditions per place. [2025-03-04 10:09:49,347 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 67 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-04 10:09:49,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 492 flow [2025-03-04 10:09:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-03-04 10:09:49,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7159090909090909 [2025-03-04 10:09:49,349 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 182 flow. Second operand 4 states and 126 transitions. [2025-03-04 10:09:49,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 492 flow [2025-03-04 10:09:49,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 486 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 10:09:49,352 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 212 flow [2025-03-04 10:09:49,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-03-04 10:09:49,352 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2025-03-04 10:09:49,352 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 212 flow [2025-03-04 10:09:49,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:09:49,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:49,353 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:49,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:09:49,353 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:09:49,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash -289624543, now seen corresponding path program 1 times [2025-03-04 10:09:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:49,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041904717] [2025-03-04 10:09:49,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:49,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:49,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:09:49,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:09:49,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:49,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:09:49,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041904717] [2025-03-04 10:09:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041904717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833407263] [2025-03-04 10:09:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:49,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:49,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2025-03-04 10:09:49,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:09:49,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:49,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2025-03-04 10:09:49,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:50,112 INFO L124 PetriNetUnfolderBase]: 6271/9089 cut-off events. [2025-03-04 10:09:50,112 INFO L125 PetriNetUnfolderBase]: For 12801/13773 co-relation queries the response was YES. [2025-03-04 10:09:50,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28469 conditions, 9089 events. 6271/9089 cut-off events. For 12801/13773 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 54834 event pairs, 1732 based on Foata normal form. 571/9504 useless extension candidates. Maximal degree in co-relation 16297. Up to 3291 conditions per place. [2025-03-04 10:09:50,164 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 71 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2025-03-04 10:09:50,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 572 flow [2025-03-04 10:09:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-03-04 10:09:50,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6988636363636364 [2025-03-04 10:09:50,168 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 212 flow. Second operand 4 states and 123 transitions. [2025-03-04 10:09:50,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 572 flow [2025-03-04 10:09:50,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 566 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 10:09:50,174 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 240 flow [2025-03-04 10:09:50,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-03-04 10:09:50,176 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2025-03-04 10:09:50,176 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 240 flow [2025-03-04 10:09:50,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:09:50,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:50,177 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:50,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:09:50,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:09:50,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1170882473, now seen corresponding path program 1 times [2025-03-04 10:09:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:50,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851880182] [2025-03-04 10:09:50,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:50,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:09:50,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:09:50,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:50,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851880182] [2025-03-04 10:09:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851880182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939965044] [2025-03-04 10:09:50,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:50,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:50,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:50,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:50,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:09:50,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:09:50,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:09:50,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:50,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:50,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:09:50,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:50,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939965044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:50,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:50,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 10:09:50,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993321790] [2025-03-04 10:09:50,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:50,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:09:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:50,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:09:50,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:09:50,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-04 10:09:50,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:09:50,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:50,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-04 10:09:50,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:51,855 INFO L124 PetriNetUnfolderBase]: 13709/22568 cut-off events. [2025-03-04 10:09:51,855 INFO L125 PetriNetUnfolderBase]: For 31345/33195 co-relation queries the response was YES. [2025-03-04 10:09:51,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69472 conditions, 22568 events. 13709/22568 cut-off events. For 31345/33195 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 162346 event pairs, 2553 based on Foata normal form. 878/23137 useless extension candidates. Maximal degree in co-relation 17508. Up to 8575 conditions per place. [2025-03-04 10:09:52,056 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 99 selfloop transitions, 22 changer transitions 1/140 dead transitions. [2025-03-04 10:09:52,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 140 transitions, 907 flow [2025-03-04 10:09:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:09:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:09:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-03-04 10:09:52,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8227272727272728 [2025-03-04 10:09:52,058 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 240 flow. Second operand 5 states and 181 transitions. [2025-03-04 10:09:52,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 140 transitions, 907 flow [2025-03-04 10:09:52,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 140 transitions, 899 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-04 10:09:52,064 INFO L231 Difference]: Finished difference. Result has 64 places, 71 transitions, 381 flow [2025-03-04 10:09:52,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2025-03-04 10:09:52,064 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2025-03-04 10:09:52,064 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 381 flow [2025-03-04 10:09:52,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:09:52,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:52,065 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:52,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:09:52,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:52,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:09:52,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash -236746115, now seen corresponding path program 2 times [2025-03-04 10:09:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:52,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327611785] [2025-03-04 10:09:52,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:52,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:09:52,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:09:52,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:52,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327611785] [2025-03-04 10:09:52,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327611785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132567023] [2025-03-04 10:09:52,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:52,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:52,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:52,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:52,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:09:52,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:09:52,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:09:52,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:52,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:09:52,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:52,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132567023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:52,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-04 10:09:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664044064] [2025-03-04 10:09:52,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:09:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:52,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:09:52,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:09:52,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-04 10:09:52,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:52,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:52,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-04 10:09:52,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:55,625 INFO L124 PetriNetUnfolderBase]: 25739/42370 cut-off events. [2025-03-04 10:09:55,626 INFO L125 PetriNetUnfolderBase]: For 78106/81786 co-relation queries the response was YES. [2025-03-04 10:09:55,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145317 conditions, 42370 events. 25739/42370 cut-off events. For 78106/81786 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 339516 event pairs, 3091 based on Foata normal form. 1763/43591 useless extension candidates. Maximal degree in co-relation 36533. Up to 14115 conditions per place. [2025-03-04 10:09:55,897 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 123 selfloop transitions, 46 changer transitions 1/188 dead transitions. [2025-03-04 10:09:55,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 188 transitions, 1337 flow [2025-03-04 10:09:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2025-03-04 10:09:55,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8371212121212122 [2025-03-04 10:09:55,900 INFO L175 Difference]: Start difference. First operand has 64 places, 71 transitions, 381 flow. Second operand 6 states and 221 transitions. [2025-03-04 10:09:55,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 188 transitions, 1337 flow [2025-03-04 10:09:55,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 188 transitions, 1253 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-03-04 10:09:55,927 INFO L231 Difference]: Finished difference. Result has 70 places, 95 transitions, 569 flow [2025-03-04 10:09:55,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=70, PETRI_TRANSITIONS=95} [2025-03-04 10:09:55,928 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2025-03-04 10:09:55,928 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 95 transitions, 569 flow [2025-03-04 10:09:55,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:55,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:55,928 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:55,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:09:56,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:09:56,129 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:09:56,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash -35130905, now seen corresponding path program 3 times [2025-03-04 10:09:56,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:56,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412560] [2025-03-04 10:09:56,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:56,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-04 10:09:56,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:09:56,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:09:56,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412560] [2025-03-04 10:09:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781445185] [2025-03-04 10:09:56,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:56,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:56,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:56,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:56,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:09:56,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-04 10:09:56,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:09:56,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:09:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:56,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:09:56,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:56,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781445185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:56,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-04 10:09:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395263187] [2025-03-04 10:09:56,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:09:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:56,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:09:56,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:09:56,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-04 10:09:56,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 95 transitions, 569 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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:09:56,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:56,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-04 10:09:56,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:01,797 INFO L124 PetriNetUnfolderBase]: 41800/68998 cut-off events. [2025-03-04 10:10:01,798 INFO L125 PetriNetUnfolderBase]: For 134948/140774 co-relation queries the response was YES. [2025-03-04 10:10:02,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239740 conditions, 68998 events. 41800/68998 cut-off events. For 134948/140774 co-relation queries the response was YES. Maximal size of possible extension queue 2252. Compared 596622 event pairs, 4298 based on Foata normal form. 2866/70816 useless extension candidates. Maximal degree in co-relation 63910. Up to 20701 conditions per place. [2025-03-04 10:10:02,391 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 146 selfloop transitions, 76 changer transitions 1/241 dead transitions. [2025-03-04 10:10:02,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 241 transitions, 1790 flow [2025-03-04 10:10:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:10:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:10:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2025-03-04 10:10:02,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8474025974025974 [2025-03-04 10:10:02,393 INFO L175 Difference]: Start difference. First operand has 70 places, 95 transitions, 569 flow. Second operand 7 states and 261 transitions. [2025-03-04 10:10:02,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 241 transitions, 1790 flow [2025-03-04 10:10:02,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 241 transitions, 1683 flow, removed 47 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:02,452 INFO L231 Difference]: Finished difference. Result has 76 places, 125 transitions, 847 flow [2025-03-04 10:10:02,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=76, PETRI_TRANSITIONS=125} [2025-03-04 10:10:02,452 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2025-03-04 10:10:02,453 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 125 transitions, 847 flow [2025-03-04 10:10:02,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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:02,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:02,453 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:10:02,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:02,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:02,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash -907011215, now seen corresponding path program 4 times [2025-03-04 10:10:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679194075] [2025-03-04 10:10:02,654 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:10:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:02,661 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:10:02,670 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:10:02,670 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:10:02,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:02,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679194075] [2025-03-04 10:10:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679194075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38381107] [2025-03-04 10:10:02,790 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:10:02,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:02,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:02,792 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:02,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:10:02,831 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:10:02,850 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:10:02,850 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:10:02,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:02,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:10:02,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:03,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38381107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:03,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:03,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-04 10:10:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146526813] [2025-03-04 10:10:03,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:03,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:10:03,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:03,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:10:03,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:10:03,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-04 10:10:03,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 125 transitions, 847 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:03,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:03,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-04 10:10:03,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:09,476 INFO L124 PetriNetUnfolderBase]: 53502/87536 cut-off events. [2025-03-04 10:10:09,476 INFO L125 PetriNetUnfolderBase]: For 210755/217900 co-relation queries the response was YES. [2025-03-04 10:10:09,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320513 conditions, 87536 events. 53502/87536 cut-off events. For 210755/217900 co-relation queries the response was YES. Maximal size of possible extension queue 2788. Compared 776307 event pairs, 11037 based on Foata normal form. 3506/89210 useless extension candidates. Maximal degree in co-relation 95384. Up to 58694 conditions per place. [2025-03-04 10:10:10,156 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 185 selfloop transitions, 54 changer transitions 1/258 dead transitions. [2025-03-04 10:10:10,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 258 transitions, 2128 flow [2025-03-04 10:10:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-03-04 10:10:10,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.821969696969697 [2025-03-04 10:10:10,157 INFO L175 Difference]: Start difference. First operand has 76 places, 125 transitions, 847 flow. Second operand 6 states and 217 transitions. [2025-03-04 10:10:10,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 258 transitions, 2128 flow [2025-03-04 10:10:10,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 258 transitions, 2014 flow, removed 40 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:10,379 INFO L231 Difference]: Finished difference. Result has 83 places, 175 transitions, 1352 flow [2025-03-04 10:10:10,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1352, PETRI_PLACES=83, PETRI_TRANSITIONS=175} [2025-03-04 10:10:10,380 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2025-03-04 10:10:10,380 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 175 transitions, 1352 flow [2025-03-04 10:10:10,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:10,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:10,380 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:10,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:10,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:10,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash -287605475, now seen corresponding path program 5 times [2025-03-04 10:10:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:10,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066567078] [2025-03-04 10:10:10,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:10:10,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:10,590 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-03-04 10:10:10,612 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:10:10,612 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:10:10,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:10,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:10,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066567078] [2025-03-04 10:10:10,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066567078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:10,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697052441] [2025-03-04 10:10:10,741 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:10:10,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:10,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:10,743 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:10,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:10:10,783 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-03-04 10:10:10,802 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:10:10,803 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:10:10,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:10,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:10:10,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:10,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697052441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:10,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:10,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-04 10:10:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132503894] [2025-03-04 10:10:10,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:10,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:10:10,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:10,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:10:10,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:10:10,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-04 10:10:10,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 175 transitions, 1352 flow. Second operand has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 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:10,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:10,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-04 10:10:10,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:20,672 INFO L124 PetriNetUnfolderBase]: 72115/118518 cut-off events. [2025-03-04 10:10:20,672 INFO L125 PetriNetUnfolderBase]: For 293909/304317 co-relation queries the response was YES. [2025-03-04 10:10:21,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434066 conditions, 118518 events. 72115/118518 cut-off events. For 293909/304317 co-relation queries the response was YES. Maximal size of possible extension queue 4189. Compared 1097620 event pairs, 6914 based on Foata normal form. 5034/121543 useless extension candidates. Maximal degree in co-relation 146264. Up to 23338 conditions per place. [2025-03-04 10:10:22,105 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 170 selfloop transitions, 162 changer transitions 1/351 dead transitions. [2025-03-04 10:10:22,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 351 transitions, 2954 flow [2025-03-04 10:10:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 301 transitions. [2025-03-04 10:10:22,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8551136363636364 [2025-03-04 10:10:22,107 INFO L175 Difference]: Start difference. First operand has 83 places, 175 transitions, 1352 flow. Second operand 8 states and 301 transitions. [2025-03-04 10:10:22,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 351 transitions, 2954 flow [2025-03-04 10:10:22,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 351 transitions, 2942 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 10:10:22,298 INFO L231 Difference]: Finished difference. Result has 91 places, 211 transitions, 1953 flow [2025-03-04 10:10:22,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1953, PETRI_PLACES=91, PETRI_TRANSITIONS=211} [2025-03-04 10:10:22,298 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2025-03-04 10:10:22,299 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 211 transitions, 1953 flow [2025-03-04 10:10:22,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 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,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:22,299 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:22,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:10:22,503 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:22,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1970452845, now seen corresponding path program 6 times [2025-03-04 10:10:22,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:22,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637882752] [2025-03-04 10:10:22,504 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:10:22,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:22,512 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 2 equivalence classes. [2025-03-04 10:10:22,535 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:10:22,535 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:10:22,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:22,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637882752] [2025-03-04 10:10:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637882752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787655444] [2025-03-04 10:10:22,808 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:10:22,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:22,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:22,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:22,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:10:22,846 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 2 equivalence classes. [2025-03-04 10:10:22,870 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:10:22,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:10:22,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:22,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:10:22,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:23,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:10:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787655444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:23,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:10:23,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-04 10:10:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099577775] [2025-03-04 10:10:23,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:23,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:10:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:23,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:10:23,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:10:23,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2025-03-04 10:10:23,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 211 transitions, 1953 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:23,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2025-03-04 10:10:23,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand