./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/pthread-C-DAC/pthread-demo-datarace-1.i -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 81147b3e42a82bd92b2fd1c17836bc41bf8598e66ad2317620561a8ac507fa9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:13:01,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:13:01,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:13:01,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:13:01,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:13:01,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:13:01,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:13:01,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:13:01,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:13:01,983 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:13:01,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:13:01,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:13:01,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:13:01,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:13:01,983 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:13:01,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:13:01,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:13:01,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:01,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:13:01,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:13:01,985 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 -> 81147b3e42a82bd92b2fd1c17836bc41bf8598e66ad2317620561a8ac507fa9a [2025-03-09 01:13:02,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:13:02,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:13:02,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:13:02,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:13:02,248 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:13:02,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-09 01:13:03,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8585af5/6866014867454f70ba5dd79789573e4a/FLAG42b15877d [2025-03-09 01:13:03,735 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:13:03,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-09 01:13:03,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8585af5/6866014867454f70ba5dd79789573e4a/FLAG42b15877d [2025-03-09 01:13:03,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8585af5/6866014867454f70ba5dd79789573e4a [2025-03-09 01:13:03,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:13:03,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:13:03,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:03,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:13:03,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:13:03,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:03" (1/1) ... [2025-03-09 01:13:03,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d41fce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:03, skipping insertion in model container [2025-03-09 01:13:03,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:03" (1/1) ... [2025-03-09 01:13:03,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:13:04,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:04,145 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:13:04,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:04,260 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:13:04,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04 WrapperNode [2025-03-09 01:13:04,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:04,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:04,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:13:04,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:13:04,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,303 INFO L138 Inliner]: procedures = 364, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-09 01:13:04,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:04,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:13:04,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:13:04,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:13:04,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,318 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-09 01:13:04,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:13:04,331 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:13:04,331 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:13:04,331 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:13:04,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (1/1) ... [2025-03-09 01:13:04,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:04,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:04,365 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-09 01:13:04,370 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-09 01:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_mutex [2025-03-09 01:13:04,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_mutex [2025-03-09 01:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:13:04,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:13:04,384 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:13:04,471 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:13:04,473 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:13:04,610 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:13:04,610 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:13:04,694 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:13:04,695 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:13:04,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:04 BoogieIcfgContainer [2025-03-09 01:13:04,696 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:13:04,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:13:04,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:13:04,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:13:04,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:13:03" (1/3) ... [2025-03-09 01:13:04,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c69b3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:04, skipping insertion in model container [2025-03-09 01:13:04,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:04" (2/3) ... [2025-03-09 01:13:04,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c69b3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:04, skipping insertion in model container [2025-03-09 01:13:04,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:04" (3/3) ... [2025-03-09 01:13:04,705 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-1.i [2025-03-09 01:13:04,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:13:04,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-1.i that has 2 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-09 01:13:04,718 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:13:04,751 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 01:13:04,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 65 flow [2025-03-09 01:13:04,796 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-09 01:13:04,800 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:04,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 28 events. 4/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-03-09 01:13:04,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 29 transitions, 65 flow [2025-03-09 01:13:04,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 27 transitions, 60 flow [2025-03-09 01:13:04,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:13:04,830 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;@a5ff57d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:13:04,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-09 01:13:04,841 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:13:04,841 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-03-09 01:13:04,841 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:04,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:04,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:04,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:04,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1134636833, now seen corresponding path program 1 times [2025-03-09 01:13:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370359705] [2025-03-09 01:13:04,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:04,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:13:04,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:13:04,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:04,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:05,067 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-09 01:13:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370359705] [2025-03-09 01:13:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370359705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:05,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:05,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018604013] [2025-03-09 01:13:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:05,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:05,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:05,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:05,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:05,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-09 01:13:05,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:05,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:05,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-09 01:13:05,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:05,198 INFO L124 PetriNetUnfolderBase]: 61/135 cut-off events. [2025-03-09 01:13:05,198 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:05,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 135 events. 61/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 407 event pairs, 27 based on Foata normal form. 9/143 useless extension candidates. Maximal degree in co-relation 247. Up to 78 conditions per place. [2025-03-09 01:13:05,201 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2025-03-09 01:13:05,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 32 transitions, 124 flow [2025-03-09 01:13:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-09 01:13:05,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-03-09 01:13:05,211 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2025-03-09 01:13:05,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 32 transitions, 124 flow [2025-03-09 01:13:05,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 32 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:05,216 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 56 flow [2025-03-09 01:13:05,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2025-03-09 01:13:05,220 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2025-03-09 01:13:05,220 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 56 flow [2025-03-09 01:13:05,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:05,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:05,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:05,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:13:05,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:05,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1145129867, now seen corresponding path program 1 times [2025-03-09 01:13:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618470055] [2025-03-09 01:13:05,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:05,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:13:05,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:13:05,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:05,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:05,290 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-09 01:13:05,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:05,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618470055] [2025-03-09 01:13:05,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618470055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:05,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:05,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:05,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639311257] [2025-03-09 01:13:05,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:05,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:05,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:05,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:05,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:05,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 01:13:05,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:05,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:05,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 01:13:05,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:05,396 INFO L124 PetriNetUnfolderBase]: 91/209 cut-off events. [2025-03-09 01:13:05,396 INFO L125 PetriNetUnfolderBase]: For 35/36 co-relation queries the response was YES. [2025-03-09 01:13:05,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 209 events. 91/209 cut-off events. For 35/36 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 737 event pairs, 46 based on Foata normal form. 9/217 useless extension candidates. Maximal degree in co-relation 123. Up to 114 conditions per place. [2025-03-09 01:13:05,399 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 25 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-03-09 01:13:05,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 32 transitions, 138 flow [2025-03-09 01:13:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-09 01:13:05,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2025-03-09 01:13:05,400 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 56 flow. Second operand 3 states and 50 transitions. [2025-03-09 01:13:05,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 32 transitions, 138 flow [2025-03-09 01:13:05,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:05,402 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 66 flow [2025-03-09 01:13:05,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2025-03-09 01:13:05,402 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2025-03-09 01:13:05,402 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 66 flow [2025-03-09 01:13:05,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:05,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:05,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:05,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:13:05,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:05,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1948242367, now seen corresponding path program 1 times [2025-03-09 01:13:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:05,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859240091] [2025-03-09 01:13:05,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:05,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:13:05,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:13:05,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:05,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:05,525 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-09 01:13:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:05,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859240091] [2025-03-09 01:13:05,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859240091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:05,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:05,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:05,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872806675] [2025-03-09 01:13:05,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:05,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:05,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:05,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:05,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:05,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 01:13:05,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-09 01:13:05,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:05,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 01:13:05,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:05,612 INFO L124 PetriNetUnfolderBase]: 59/154 cut-off events. [2025-03-09 01:13:05,614 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-09 01:13:05,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 154 events. 59/154 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 459 event pairs, 20 based on Foata normal form. 16/169 useless extension candidates. Maximal degree in co-relation 117. Up to 72 conditions per place. [2025-03-09 01:13:05,617 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 21 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-03-09 01:13:05,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 146 flow [2025-03-09 01:13:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-03-09 01:13:05,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2025-03-09 01:13:05,620 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 66 flow. Second operand 3 states and 47 transitions. [2025-03-09 01:13:05,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 146 flow [2025-03-09 01:13:05,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:05,621 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 72 flow [2025-03-09 01:13:05,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2025-03-09 01:13:05,623 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-03-09 01:13:05,623 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 72 flow [2025-03-09 01:13:05,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-09 01:13:05,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:05,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:05,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:13:05,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:05,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1333242225, now seen corresponding path program 2 times [2025-03-09 01:13:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:05,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915001221] [2025-03-09 01:13:05,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:05,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:13:05,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:13:05,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:13:05,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:05,692 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-09 01:13:05,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:05,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915001221] [2025-03-09 01:13:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915001221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:05,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857668372] [2025-03-09 01:13:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:05,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:13:05,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:05,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:13:05,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:13:05,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 01:13:05,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-09 01:13:05,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:05,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 01:13:05,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:05,785 INFO L124 PetriNetUnfolderBase]: 79/217 cut-off events. [2025-03-09 01:13:05,785 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-09 01:13:05,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 217 events. 79/217 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 721 event pairs, 18 based on Foata normal form. 9/226 useless extension candidates. Maximal degree in co-relation 180. Up to 90 conditions per place. [2025-03-09 01:13:05,788 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 34 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-03-09 01:13:05,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 214 flow [2025-03-09 01:13:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:13:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:13:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-09 01:13:05,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5775862068965517 [2025-03-09 01:13:05,789 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 72 flow. Second operand 4 states and 67 transitions. [2025-03-09 01:13:05,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 214 flow [2025-03-09 01:13:05,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:05,790 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 84 flow [2025-03-09 01:13:05,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-03-09 01:13:05,791 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2025-03-09 01:13:05,791 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 84 flow [2025-03-09 01:13:05,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-09 01:13:05,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:05,791 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:05,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:13:05,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:05,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1283294491, now seen corresponding path program 3 times [2025-03-09 01:13:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:05,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589654601] [2025-03-09 01:13:05,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:13:05,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:05,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-09 01:13:05,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 26 statements. [2025-03-09 01:13:05,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:13:05,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:05,864 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-09 01:13:05,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589654601] [2025-03-09 01:13:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589654601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064937380] [2025-03-09 01:13:05,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:13:05,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:05,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:05,867 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-09 01:13:05,869 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-09 01:13:05,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-09 01:13:05,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 26 statements. [2025-03-09 01:13:05,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:13:05,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:05,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:13:05,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:06,017 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-09 01:13:06,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:06,059 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-09 01:13:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064937380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:06,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:06,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:13:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528981909] [2025-03-09 01:13:06,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:06,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:06,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:06,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:06,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-03-09 01:13:06,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 84 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-09 01:13:06,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:06,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-03-09 01:13:06,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:06,182 INFO L124 PetriNetUnfolderBase]: 227/523 cut-off events. [2025-03-09 01:13:06,183 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2025-03-09 01:13:06,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 523 events. 227/523 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1973 event pairs, 35 based on Foata normal form. 42/565 useless extension candidates. Maximal degree in co-relation 428. Up to 118 conditions per place. [2025-03-09 01:13:06,187 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 62 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-03-09 01:13:06,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 71 transitions, 420 flow [2025-03-09 01:13:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:13:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:13:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-03-09 01:13:06,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5574712643678161 [2025-03-09 01:13:06,192 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 84 flow. Second operand 6 states and 97 transitions. [2025-03-09 01:13:06,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 71 transitions, 420 flow [2025-03-09 01:13:06,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 71 transitions, 390 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:06,193 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 118 flow [2025-03-09 01:13:06,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-03-09 01:13:06,194 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2025-03-09 01:13:06,194 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 118 flow [2025-03-09 01:13:06,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-09 01:13:06,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:06,194 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:06,202 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-09 01:13:06,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:06,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:06,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash -893965580, now seen corresponding path program 4 times [2025-03-09 01:13:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:06,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400798200] [2025-03-09 01:13:06,397 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:13:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:06,407 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-09 01:13:06,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:13:06,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:13:06,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:13:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400798200] [2025-03-09 01:13:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400798200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911781949] [2025-03-09 01:13:06,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:13:06,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:06,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:06,512 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-09 01:13:06,514 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-09 01:13:06,559 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-09 01:13:06,586 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:13:06,586 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:13:06,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:06,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:13:06,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:13:06,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:13:06,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911781949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:06,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:06,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-09 01:13:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454191778] [2025-03-09 01:13:06,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:06,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:13:06,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:06,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:13:06,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:13:06,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-03-09 01:13:06,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 118 flow. Second operand has 15 states, 15 states have (on average 11.533333333333333) internal successors, (173), 15 states have internal predecessors, (173), 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-09 01:13:06,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:06,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-03-09 01:13:06,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:07,505 INFO L124 PetriNetUnfolderBase]: 635/1471 cut-off events. [2025-03-09 01:13:07,505 INFO L125 PetriNetUnfolderBase]: For 2116/2116 co-relation queries the response was YES. [2025-03-09 01:13:07,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4649 conditions, 1471 events. 635/1471 cut-off events. For 2116/2116 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6520 event pairs, 10 based on Foata normal form. 161/1632 useless extension candidates. Maximal degree in co-relation 1299. Up to 265 conditions per place. [2025-03-09 01:13:07,515 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 323 selfloop transitions, 92 changer transitions 0/418 dead transitions. [2025-03-09 01:13:07,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 418 transitions, 2488 flow [2025-03-09 01:13:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-09 01:13:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-09 01:13:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 720 transitions. [2025-03-09 01:13:07,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-03-09 01:13:07,520 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 118 flow. Second operand 45 states and 720 transitions. [2025-03-09 01:13:07,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 418 transitions, 2488 flow [2025-03-09 01:13:07,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 418 transitions, 2408 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:07,560 INFO L231 Difference]: Finished difference. Result has 112 places, 111 transitions, 994 flow [2025-03-09 01:13:07,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=994, PETRI_PLACES=112, PETRI_TRANSITIONS=111} [2025-03-09 01:13:07,562 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 85 predicate places. [2025-03-09 01:13:07,563 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 111 transitions, 994 flow [2025-03-09 01:13:07,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.533333333333333) internal successors, (173), 15 states have internal predecessors, (173), 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-09 01:13:07,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:07,564 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:07,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:13:07,764 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,SelfDestructingSolverStorable5 [2025-03-09 01:13:07,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:07,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:07,767 INFO L85 PathProgramCache]: Analyzing trace with hash 421269142, now seen corresponding path program 5 times [2025-03-09 01:13:07,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:07,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438271984] [2025-03-09 01:13:07,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:13:07,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:07,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 11 equivalence classes. [2025-03-09 01:13:07,813 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 01:13:07,813 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 01:13:07,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-09 01:13:07,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:07,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438271984] [2025-03-09 01:13:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438271984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:07,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078505360] [2025-03-09 01:13:07,910 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:13:07,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:07,912 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-09 01:13:07,913 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-09 01:13:07,966 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 11 equivalence classes. [2025-03-09 01:13:08,008 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 01:13:08,008 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 01:13:08,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:08,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:13:08,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:13:08,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:13:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078505360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:08,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:08,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 26 [2025-03-09 01:13:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183677454] [2025-03-09 01:13:08,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:08,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:13:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:08,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:13:08,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=405, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:13:08,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-03-09 01:13:08,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 111 transitions, 994 flow. Second operand has 26 states, 26 states have (on average 11.26923076923077) internal successors, (293), 26 states have internal predecessors, (293), 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-09 01:13:08,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:08,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-03-09 01:13:08,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:10,803 INFO L124 PetriNetUnfolderBase]: 1467/3388 cut-off events. [2025-03-09 01:13:10,805 INFO L125 PetriNetUnfolderBase]: For 123316/123316 co-relation queries the response was YES. [2025-03-09 01:13:10,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16962 conditions, 3388 events. 1467/3388 cut-off events. For 123316/123316 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 16518 event pairs, 10 based on Foata normal form. 323/3711 useless extension candidates. Maximal degree in co-relation 14780. Up to 618 conditions per place. [2025-03-09 01:13:10,833 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 767 selfloop transitions, 255 changer transitions 0/1025 dead transitions. [2025-03-09 01:13:10,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 1025 transitions, 8916 flow [2025-03-09 01:13:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-09 01:13:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2025-03-09 01:13:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 1689 transitions. [2025-03-09 01:13:10,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5494469746258946 [2025-03-09 01:13:10,842 INFO L175 Difference]: Start difference. First operand has 112 places, 111 transitions, 994 flow. Second operand 106 states and 1689 transitions. [2025-03-09 01:13:10,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 1025 transitions, 8916 flow [2025-03-09 01:13:10,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 1025 transitions, 8638 flow, removed 62 selfloop flow, removed 5 redundant places. [2025-03-09 01:13:10,926 INFO L231 Difference]: Finished difference. Result has 277 places, 278 transitions, 3730 flow [2025-03-09 01:13:10,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=3730, PETRI_PLACES=277, PETRI_TRANSITIONS=278} [2025-03-09 01:13:10,927 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 250 predicate places. [2025-03-09 01:13:10,927 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 278 transitions, 3730 flow [2025-03-09 01:13:10,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.26923076923077) internal successors, (293), 26 states have internal predecessors, (293), 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-09 01:13:10,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:10,928 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:10,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:13:11,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:11,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:11,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1483702870, now seen corresponding path program 6 times [2025-03-09 01:13:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271707809] [2025-03-09 01:13:11,129 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:13:11,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:11,151 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 131 statements into 21 equivalence classes. [2025-03-09 01:13:11,167 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 71 of 131 statements. [2025-03-09 01:13:11,167 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 01:13:11,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-09 01:13:11,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:11,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271707809] [2025-03-09 01:13:11,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271707809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:11,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113282034] [2025-03-09 01:13:11,284 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:13:11,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:11,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:11,286 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-09 01:13:11,288 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-09 01:13:11,354 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 131 statements into 21 equivalence classes. [2025-03-09 01:13:11,403 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 71 of 131 statements. [2025-03-09 01:13:11,403 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 01:13:11,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:11,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:13:11,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-09 01:13:11,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-09 01:13:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113282034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:11,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 01:13:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225336947] [2025-03-09 01:13:11,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:11,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:13:11,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:11,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:13:11,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:13:11,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-09 01:13:11,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 278 transitions, 3730 flow. Second operand has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 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-09 01:13:11,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:11,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-09 01:13:11,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:13,080 INFO L124 PetriNetUnfolderBase]: 2885/6840 cut-off events. [2025-03-09 01:13:13,081 INFO L125 PetriNetUnfolderBase]: For 513685/513969 co-relation queries the response was YES. [2025-03-09 01:13:13,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49126 conditions, 6840 events. 2885/6840 cut-off events. For 513685/513969 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 41338 event pairs, 392 based on Foata normal form. 606/7269 useless extension candidates. Maximal degree in co-relation 46062. Up to 1113 conditions per place. [2025-03-09 01:13:13,171 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 310 selfloop transitions, 152 changer transitions 0/476 dead transitions. [2025-03-09 01:13:13,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 476 transitions, 6736 flow [2025-03-09 01:13:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:13:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:13:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2025-03-09 01:13:13,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-09 01:13:13,173 INFO L175 Difference]: Start difference. First operand has 277 places, 278 transitions, 3730 flow. Second operand 12 states and 203 transitions. [2025-03-09 01:13:13,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 476 transitions, 6736 flow [2025-03-09 01:13:13,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 476 transitions, 5944 flow, removed 261 selfloop flow, removed 36 redundant places. [2025-03-09 01:13:13,764 INFO L231 Difference]: Finished difference. Result has 259 places, 284 transitions, 3782 flow [2025-03-09 01:13:13,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3782, PETRI_PLACES=259, PETRI_TRANSITIONS=284} [2025-03-09 01:13:13,765 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 232 predicate places. [2025-03-09 01:13:13,765 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 284 transitions, 3782 flow [2025-03-09 01:13:13,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 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-09 01:13:13,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:13,766 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:13,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:13:13,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:13,967 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:13,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -137420602, now seen corresponding path program 7 times [2025-03-09 01:13:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320916054] [2025-03-09 01:13:13,969 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:13:13,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:13,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-09 01:13:14,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-09 01:13:14,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:14,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-03-09 01:13:14,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320916054] [2025-03-09 01:13:14,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320916054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898972588] [2025-03-09 01:13:14,409 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:13:14,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:14,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:14,411 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-09 01:13:14,417 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-09 01:13:14,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-09 01:13:14,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-09 01:13:14,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:14,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:14,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:13:14,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-03-09 01:13:14,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-03-09 01:13:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898972588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:14,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:14,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-03-09 01:13:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479196845] [2025-03-09 01:13:14,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:14,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:13:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:15,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:13:15,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:13:15,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-09 01:13:15,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 284 transitions, 3782 flow. Second operand has 23 states, 23 states have (on average 12.391304347826088) internal successors, (285), 23 states have internal predecessors, (285), 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-09 01:13:15,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:15,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-09 01:13:15,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:18,246 INFO L124 PetriNetUnfolderBase]: 5534/12959 cut-off events. [2025-03-09 01:13:18,247 INFO L125 PetriNetUnfolderBase]: For 1296534/1297086 co-relation queries the response was YES. [2025-03-09 01:13:18,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107840 conditions, 12959 events. 5534/12959 cut-off events. For 1296534/1297086 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 85871 event pairs, 562 based on Foata normal form. 1022/13624 useless extension candidates. Maximal degree in co-relation 100652. Up to 2163 conditions per place. [2025-03-09 01:13:18,363 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 590 selfloop transitions, 162 changer transitions 0/766 dead transitions. [2025-03-09 01:13:18,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 766 transitions, 10306 flow [2025-03-09 01:13:18,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:13:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:13:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 377 transitions. [2025-03-09 01:13:18,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-03-09 01:13:18,366 INFO L175 Difference]: Start difference. First operand has 259 places, 284 transitions, 3782 flow. Second operand 22 states and 377 transitions. [2025-03-09 01:13:18,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 766 transitions, 10306 flow [2025-03-09 01:13:19,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 766 transitions, 9556 flow, removed 256 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:19,189 INFO L231 Difference]: Finished difference. Result has 287 places, 295 transitions, 4178 flow [2025-03-09 01:13:19,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3352, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4178, PETRI_PLACES=287, PETRI_TRANSITIONS=295} [2025-03-09 01:13:19,190 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 260 predicate places. [2025-03-09 01:13:19,190 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 295 transitions, 4178 flow [2025-03-09 01:13:19,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.391304347826088) internal successors, (285), 23 states have internal predecessors, (285), 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-09 01:13:19,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:19,191 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:19,198 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-09 01:13:19,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:19,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:19,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash 837088518, now seen corresponding path program 8 times [2025-03-09 01:13:19,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:19,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475738703] [2025-03-09 01:13:19,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:19,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:19,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 211 statements into 2 equivalence classes. [2025-03-09 01:13:19,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 211 of 211 statements. [2025-03-09 01:13:19,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:13:19,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:22,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475738703] [2025-03-09 01:13:22,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475738703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078556189] [2025-03-09 01:13:22,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:22,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:22,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:22,160 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-09 01:13:22,161 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-09 01:13:22,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 211 statements into 2 equivalence classes. [2025-03-09 01:13:22,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 211 of 211 statements. [2025-03-09 01:13:22,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:13:22,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:22,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-09 01:13:22,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:22,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078556189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:22,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 44 [2025-03-09 01:13:22,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552366630] [2025-03-09 01:13:22,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:22,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-09 01:13:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:22,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-09 01:13:22,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2025-03-09 01:13:22,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-09 01:13:22,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 295 transitions, 4178 flow. Second operand has 45 states, 45 states have (on average 10.777777777777779) internal successors, (485), 45 states have internal predecessors, (485), 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-09 01:13:22,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:22,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-09 01:13:22,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:34,024 INFO L124 PetriNetUnfolderBase]: 9003/23257 cut-off events. [2025-03-09 01:13:34,024 INFO L125 PetriNetUnfolderBase]: For 3667230/3667230 co-relation queries the response was YES. [2025-03-09 01:13:34,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252106 conditions, 23257 events. 9003/23257 cut-off events. For 3667230/3667230 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 184033 event pairs, 943 based on Foata normal form. 1/23257 useless extension candidates. Maximal degree in co-relation 241912. Up to 5263 conditions per place. [2025-03-09 01:13:34,451 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 1960 selfloop transitions, 83 changer transitions 2/2062 dead transitions. [2025-03-09 01:13:34,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 2062 transitions, 44121 flow [2025-03-09 01:13:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-09 01:13:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-09 01:13:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 754 transitions. [2025-03-09 01:13:34,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-03-09 01:13:34,458 INFO L175 Difference]: Start difference. First operand has 287 places, 295 transitions, 4178 flow. Second operand 44 states and 754 transitions. [2025-03-09 01:13:34,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 2062 transitions, 44121 flow [2025-03-09 01:13:45,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 2062 transitions, 43018 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-09 01:13:45,243 INFO L231 Difference]: Finished difference. Result has 323 places, 377 transitions, 4252 flow [2025-03-09 01:13:45,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3910, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4252, PETRI_PLACES=323, PETRI_TRANSITIONS=377} [2025-03-09 01:13:45,244 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 296 predicate places. [2025-03-09 01:13:45,244 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 377 transitions, 4252 flow [2025-03-09 01:13:45,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.777777777777779) internal successors, (485), 45 states have internal predecessors, (485), 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-09 01:13:45,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:45,244 INFO L206 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:45,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:13:45,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:45,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:45,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:45,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1465549051, now seen corresponding path program 9 times [2025-03-09 01:13:45,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:45,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854288875] [2025-03-09 01:13:45,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:13:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:45,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 20 equivalence classes. [2025-03-09 01:13:45,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 216 of 216 statements. [2025-03-09 01:13:45,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-03-09 01:13:45,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 950 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2025-03-09 01:13:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:46,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854288875] [2025-03-09 01:13:46,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854288875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:46,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:46,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-09 01:13:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892364256] [2025-03-09 01:13:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:46,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:13:46,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:46,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:13:46,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:13:46,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-03-09 01:13:46,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 377 transitions, 4252 flow. Second operand has 23 states, 23 states have (on average 11.130434782608695) internal successors, (256), 23 states have internal predecessors, (256), 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-09 01:13:46,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:46,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-03-09 01:13:46,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:52,328 INFO L124 PetriNetUnfolderBase]: 9149/21017 cut-off events. [2025-03-09 01:13:52,328 INFO L125 PetriNetUnfolderBase]: For 2509499/2509499 co-relation queries the response was YES. [2025-03-09 01:13:52,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206659 conditions, 21017 events. 9149/21017 cut-off events. For 2509499/2509499 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 157501 event pairs, 74 based on Foata normal form. 89/21105 useless extension candidates. Maximal degree in co-relation 206526. Up to 5070 conditions per place. [2025-03-09 01:13:52,659 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 2028 selfloop transitions, 105 changer transitions 0/2138 dead transitions. [2025-03-09 01:13:52,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 2138 transitions, 31666 flow [2025-03-09 01:13:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 01:13:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-09 01:13:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 378 transitions. [2025-03-09 01:13:52,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5667166416791605 [2025-03-09 01:13:52,660 INFO L175 Difference]: Start difference. First operand has 323 places, 377 transitions, 4252 flow. Second operand 23 states and 378 transitions. [2025-03-09 01:13:52,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 2138 transitions, 31666 flow [2025-03-09 01:13:56,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 2138 transitions, 31664 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:56,188 INFO L231 Difference]: Finished difference. Result has 343 places, 372 transitions, 4390 flow [2025-03-09 01:13:56,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4180, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4390, PETRI_PLACES=343, PETRI_TRANSITIONS=372} [2025-03-09 01:13:56,189 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 316 predicate places. [2025-03-09 01:13:56,189 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 372 transitions, 4390 flow [2025-03-09 01:13:56,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.130434782608695) internal successors, (256), 23 states have internal predecessors, (256), 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-09 01:13:56,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:56,189 INFO L206 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:56,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:13:56,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-09 01:13:56,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:56,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1968934488, now seen corresponding path program 10 times [2025-03-09 01:13:56,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:56,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696403577] [2025-03-09 01:13:56,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:13:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:56,213 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 216 statements into 2 equivalence classes. [2025-03-09 01:13:56,240 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 216 of 216 statements. [2025-03-09 01:13:56,240 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:13:56,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2041 backedges. 1071 proven. 0 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-09 01:13:56,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:56,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696403577] [2025-03-09 01:13:56,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696403577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:56,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:56,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-09 01:13:56,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114898200] [2025-03-09 01:13:56,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:56,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:13:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:56,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:13:56,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:13:56,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-09 01:13:56,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 372 transitions, 4390 flow. Second operand has 23 states, 23 states have (on average 12.08695652173913) internal successors, (278), 23 states have internal predecessors, (278), 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-09 01:13:56,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:56,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-09 01:13:56,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:59,782 INFO L124 PetriNetUnfolderBase]: 5398/12776 cut-off events. [2025-03-09 01:13:59,783 INFO L125 PetriNetUnfolderBase]: For 508552/509044 co-relation queries the response was YES. [2025-03-09 01:13:59,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89804 conditions, 12776 events. 5398/12776 cut-off events. For 508552/509044 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 86268 event pairs, 457 based on Foata normal form. 84/12505 useless extension candidates. Maximal degree in co-relation 89146. Up to 2163 conditions per place. [2025-03-09 01:14:00,006 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 0 selfloop transitions, 0 changer transitions 1618/1618 dead transitions. [2025-03-09 01:14:00,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1618 transitions, 15951 flow [2025-03-09 01:14:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 01:14:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-09 01:14:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 377 transitions. [2025-03-09 01:14:00,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2025-03-09 01:14:00,007 INFO L175 Difference]: Start difference. First operand has 343 places, 372 transitions, 4390 flow. Second operand 23 states and 377 transitions. [2025-03-09 01:14:00,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1618 transitions, 15951 flow [2025-03-09 01:14:01,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 1618 transitions, 15013 flow, removed 0 selfloop flow, removed 24 redundant places. [2025-03-09 01:14:01,513 INFO L231 Difference]: Finished difference. Result has 337 places, 0 transitions, 0 flow [2025-03-09 01:14:01,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4112, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=0, PETRI_PLACES=337, PETRI_TRANSITIONS=0} [2025-03-09 01:14:01,517 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 310 predicate places. [2025-03-09 01:14:01,517 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 0 transitions, 0 flow [2025-03-09 01:14:01,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.08695652173913) internal successors, (278), 23 states have internal predecessors, (278), 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-09 01:14:01,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2025-03-09 01:14:01,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2025-03-09 01:14:01,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-09 01:14:01,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:14:01,523 INFO L422 BasicCegarLoop]: Path program histogram: [10, 1, 1] [2025-03-09 01:14:01,530 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:14:01,530 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:14:01,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:14:01 BasicIcfg [2025-03-09 01:14:01,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:14:01,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:14:01,541 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:14:01,541 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:14:01,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:04" (3/4) ... [2025-03-09 01:14:01,543 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:14:01,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread_function_mutex [2025-03-09 01:14:01,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2025-03-09 01:14:01,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-09 01:14:01,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-09 01:14:01,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:14:01,644 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:14:01,645 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:14:01,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:14:01,645 INFO L158 Benchmark]: Toolchain (without parser) took 57872.86ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 120.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-09 01:14:01,646 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:14:01,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.56ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 83.8MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 01:14:01,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.57ms. Allocated memory is still 167.8MB. Free memory was 83.8MB in the beginning and 81.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:14:01,647 INFO L158 Benchmark]: Boogie Preprocessor took 25.54ms. Allocated memory is still 167.8MB. Free memory was 81.7MB in the beginning and 80.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:14:01,648 INFO L158 Benchmark]: IcfgBuilder took 365.33ms. Allocated memory is still 167.8MB. Free memory was 80.0MB in the beginning and 58.2MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:14:01,648 INFO L158 Benchmark]: TraceAbstraction took 56842.39ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 57.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-03-09 01:14:01,648 INFO L158 Benchmark]: Witness Printer took 104.23ms. Allocated memory is still 3.1GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:14:01,649 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.56ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 83.8MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.57ms. Allocated memory is still 167.8MB. Free memory was 83.8MB in the beginning and 81.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.54ms. Allocated memory is still 167.8MB. Free memory was 81.7MB in the beginning and 80.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 365.33ms. Allocated memory is still 167.8MB. Free memory was 80.0MB in the beginning and 58.2MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 56842.39ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 57.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 104.23ms. Allocated memory is still 3.1GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1334]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 34 locations, 38 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 56.8s, OverallIterations: 12, TraceHistogramMax: 21, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 47.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2907 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2891 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21311 IncrementalHoareTripleChecker+Invalid, 21365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 6 mSDtfsCounter, 21311 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1618 GetRequests, 1338 SyntacticMatches, 5 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3909 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4390occurred in iteration=11, InterpolantAutomatonStates: 294, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1793 NumberOfCodeBlocks, 1663 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 2415 ConstructedInterpolants, 0 QuantifiedInterpolants, 5646 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2517 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 8568/15741 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:14:01,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE