./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/triangular-longest-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/triangular-longest-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 81809963fcaff21fd6241cde97e522447f695a8b323a0a16c5a31b7f82b0f683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:56:14,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:56:14,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:56:14,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:56:14,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:56:14,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:56:14,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:56:14,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:56:14,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:56:14,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:56:14,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:56:14,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:56:14,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:56:14,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:56:14,179 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:56:14,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:56:14,180 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:56:14,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:56:14,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:56:14,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:56:14,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:56:14,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:56:14,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:56:14,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:56:14,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:56:14,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:56:14,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:56:14,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:56:14,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:56:14,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:56:14,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:56:14,182 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 -> 81809963fcaff21fd6241cde97e522447f695a8b323a0a16c5a31b7f82b0f683 [2025-03-09 00:56:14,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:56:14,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:56:14,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:56:14,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:56:14,438 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:56:14,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-1.i [2025-03-09 00:56:16,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19e5f3b9/4f2d1ed192d74fec96a43aa10c88bc52/FLAGfebf4eeec [2025-03-09 00:56:16,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:56:16,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-1.i [2025-03-09 00:56:16,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19e5f3b9/4f2d1ed192d74fec96a43aa10c88bc52/FLAGfebf4eeec [2025-03-09 00:56:16,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19e5f3b9/4f2d1ed192d74fec96a43aa10c88bc52 [2025-03-09 00:56:16,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:56:16,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:56:16,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:56:16,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:56:16,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:56:16,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb92a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16, skipping insertion in model container [2025-03-09 00:56:16,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:56:16,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:56:16,874 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:56:16,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:56:16,923 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:56:16,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16 WrapperNode [2025-03-09 00:56:16,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:56:16,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:56:16,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:56:16,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:56:16,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,948 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-09 00:56:16,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:56:16,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:56:16,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:56:16,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:56:16,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,969 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 00:56:16,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:56:16,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:56:16,978 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:56:16,978 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:56:16,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (1/1) ... [2025-03-09 00:56:16,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:56:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:17,010 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 00:56:17,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:56:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:56:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:56:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:56:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:56:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:56:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:56:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:56:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:56:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:56:17,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:56:17,034 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 00:56:17,124 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:56:17,127 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:56:17,263 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:56:17,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:56:17,340 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:56:17,340 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:56:17,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:17 BoogieIcfgContainer [2025-03-09 00:56:17,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:56:17,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:56:17,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:56:17,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:56:17,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:56:16" (1/3) ... [2025-03-09 00:56:17,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf1c8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:56:17, skipping insertion in model container [2025-03-09 00:56:17,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:16" (2/3) ... [2025-03-09 00:56:17,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf1c8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:56:17, skipping insertion in model container [2025-03-09 00:56:17,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:17" (3/3) ... [2025-03-09 00:56:17,351 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2025-03-09 00:56:17,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:56:17,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-1.i that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-09 00:56:17,365 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:56:17,406 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:56:17,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-03-09 00:56:17,452 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-09 00:56:17,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:56:17,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 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/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-09 00:56:17,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-03-09 00:56:17,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-03-09 00:56:17,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:56:17,484 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;@3dc75625, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:56:17,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 00:56:17,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:56:17,503 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-09 00:56:17,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:56:17,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:17,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:17,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:17,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1499979287, now seen corresponding path program 1 times [2025-03-09 00:56:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:17,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279663781] [2025-03-09 00:56:17,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:17,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:17,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:56:17,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:56:17,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:17,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:17,714 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 00:56:17,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279663781] [2025-03-09 00:56:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279663781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:17,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:17,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:56:17,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441272977] [2025-03-09 00:56:17,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:17,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:17,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:17,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:17,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:17,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 00:56:17,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:17,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:17,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:17,862 INFO L124 PetriNetUnfolderBase]: 185/363 cut-off events. [2025-03-09 00:56:17,862 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 00:56:17,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 363 events. 185/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1602 event pairs, 135 based on Foata normal form. 32/390 useless extension candidates. Maximal degree in co-relation 657. Up to 290 conditions per place. [2025-03-09 00:56:17,869 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 15 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2025-03-09 00:56:17,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 86 flow [2025-03-09 00:56:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:56:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:56:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-09 00:56:17,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2025-03-09 00:56:17,883 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 44 transitions. [2025-03-09 00:56:17,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 86 flow [2025-03-09 00:56:17,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:17,889 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2025-03-09 00:56:17,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-03-09 00:56:17,895 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2025-03-09 00:56:17,896 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2025-03-09 00:56:17,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 00:56:17,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:17,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:17,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:56:17,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:17,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:17,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1499979786, now seen corresponding path program 1 times [2025-03-09 00:56:17,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:17,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606938747] [2025-03-09 00:56:17,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:17,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:56:17,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:56:17,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:17,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:18,153 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 00:56:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:18,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606938747] [2025-03-09 00:56:18,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606938747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:18,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:18,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:18,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012022056] [2025-03-09 00:56:18,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:18,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:56:18,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:18,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:56:18,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:56:18,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:18,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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 00:56:18,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:18,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:18,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:18,366 INFO L124 PetriNetUnfolderBase]: 273/491 cut-off events. [2025-03-09 00:56:18,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:56:18,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 491 events. 273/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2024 event pairs, 45 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 925. Up to 181 conditions per place. [2025-03-09 00:56:18,372 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2025-03-09 00:56:18,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 212 flow [2025-03-09 00:56:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:56:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:56:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-03-09 00:56:18,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-03-09 00:56:18,376 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 6 states and 99 transitions. [2025-03-09 00:56:18,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 212 flow [2025-03-09 00:56:18,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:18,378 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 74 flow [2025-03-09 00:56:18,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2025-03-09 00:56:18,378 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2025-03-09 00:56:18,379 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 74 flow [2025-03-09 00:56:18,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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 00:56:18,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:18,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:18,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:56:18,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:18,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:18,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1591607260, now seen corresponding path program 1 times [2025-03-09 00:56:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:18,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011927379] [2025-03-09 00:56:18,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:18,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:56:18,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:56:18,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:18,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:18,535 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 00:56:18,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:18,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011927379] [2025-03-09 00:56:18,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011927379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:18,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:18,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:56:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406560860] [2025-03-09 00:56:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:18,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:56:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:18,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:56:18,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:56:18,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:18,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 00:56:18,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:18,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:18,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:18,749 INFO L124 PetriNetUnfolderBase]: 382/707 cut-off events. [2025-03-09 00:56:18,749 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2025-03-09 00:56:18,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 707 events. 382/707 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3107 event pairs, 65 based on Foata normal form. 33/739 useless extension candidates. Maximal degree in co-relation 1594. Up to 246 conditions per place. [2025-03-09 00:56:18,753 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 9 changer transitions 20/79 dead transitions. [2025-03-09 00:56:18,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 382 flow [2025-03-09 00:56:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:56:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 00:56:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-03-09 00:56:18,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-03-09 00:56:18,754 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 74 flow. Second operand 9 states and 144 transitions. [2025-03-09 00:56:18,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 382 flow [2025-03-09 00:56:18,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 366 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:18,758 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 159 flow [2025-03-09 00:56:18,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-03-09 00:56:18,760 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2025-03-09 00:56:18,760 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2025-03-09 00:56:18,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 00:56:18,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:18,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:18,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:56:18,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:18,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1595175136, now seen corresponding path program 2 times [2025-03-09 00:56:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:18,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875192268] [2025-03-09 00:56:18,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:56:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:18,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:56:18,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:56:18,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:56:18,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:18,912 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 00:56:18,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:18,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875192268] [2025-03-09 00:56:18,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875192268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:18,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:18,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:56:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996190755] [2025-03-09 00:56:18,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:18,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:56:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:18,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:56:18,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:56:18,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:18,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 00:56:18,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:18,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:18,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:19,113 INFO L124 PetriNetUnfolderBase]: 328/614 cut-off events. [2025-03-09 00:56:19,113 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2025-03-09 00:56:19,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 614 events. 328/614 cut-off events. For 1001/1013 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2617 event pairs, 65 based on Foata normal form. 57/670 useless extension candidates. Maximal degree in co-relation 1726. Up to 234 conditions per place. [2025-03-09 00:56:19,124 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2025-03-09 00:56:19,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 499 flow [2025-03-09 00:56:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:56:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 00:56:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-03-09 00:56:19,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2025-03-09 00:56:19,127 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 8 states and 127 transitions. [2025-03-09 00:56:19,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 499 flow [2025-03-09 00:56:19,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:19,133 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 213 flow [2025-03-09 00:56:19,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2025-03-09 00:56:19,136 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-03-09 00:56:19,136 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 213 flow [2025-03-09 00:56:19,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 00:56:19,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:19,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:19,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:56:19,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:19,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash 29952673, now seen corresponding path program 1 times [2025-03-09 00:56:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:19,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731826657] [2025-03-09 00:56:19,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:19,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:19,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 00:56:19,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 00:56:19,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:19,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:19,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731826657] [2025-03-09 00:56:19,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731826657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:19,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:19,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:56:19,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105886697] [2025-03-09 00:56:19,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:19,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:56:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:19,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:56:19,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:56:19,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:19,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 213 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 00:56:19,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:19,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:19,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:19,514 INFO L124 PetriNetUnfolderBase]: 337/626 cut-off events. [2025-03-09 00:56:19,515 INFO L125 PetriNetUnfolderBase]: For 1712/1724 co-relation queries the response was YES. [2025-03-09 00:56:19,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 626 events. 337/626 cut-off events. For 1712/1724 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2657 event pairs, 68 based on Foata normal form. 30/655 useless extension candidates. Maximal degree in co-relation 1929. Up to 237 conditions per place. [2025-03-09 00:56:19,518 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 16 changer transitions 24/90 dead transitions. [2025-03-09 00:56:19,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 610 flow [2025-03-09 00:56:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:56:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 00:56:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2025-03-09 00:56:19,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2025-03-09 00:56:19,520 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 213 flow. Second operand 11 states and 168 transitions. [2025-03-09 00:56:19,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 610 flow [2025-03-09 00:56:19,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 543 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-09 00:56:19,525 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 282 flow [2025-03-09 00:56:19,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2025-03-09 00:56:19,526 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2025-03-09 00:56:19,526 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 282 flow [2025-03-09 00:56:19,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 00:56:19,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:19,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:19,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:56:19,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:19,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1774460803, now seen corresponding path program 2 times [2025-03-09 00:56:19,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:19,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629081601] [2025-03-09 00:56:19,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:56:19,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:19,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-09 00:56:19,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 00:56:19,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:56:19,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:19,612 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 00:56:19,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629081601] [2025-03-09 00:56:19,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629081601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:19,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:19,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:56:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419465313] [2025-03-09 00:56:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:19,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:56:19,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:19,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:56:19,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:56:19,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:19,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 00:56:19,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:19,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:19,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:19,834 INFO L124 PetriNetUnfolderBase]: 508/938 cut-off events. [2025-03-09 00:56:19,834 INFO L125 PetriNetUnfolderBase]: For 3237/3255 co-relation queries the response was YES. [2025-03-09 00:56:19,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 938 events. 508/938 cut-off events. For 3237/3255 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4321 event pairs, 53 based on Foata normal form. 45/980 useless extension candidates. Maximal degree in co-relation 3059. Up to 253 conditions per place. [2025-03-09 00:56:19,838 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 57 selfloop transitions, 20 changer transitions 23/104 dead transitions. [2025-03-09 00:56:19,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 774 flow [2025-03-09 00:56:19,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:56:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 00:56:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2025-03-09 00:56:19,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-09 00:56:19,841 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 282 flow. Second operand 11 states and 174 transitions. [2025-03-09 00:56:19,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 774 flow [2025-03-09 00:56:19,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 104 transitions, 708 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-03-09 00:56:19,846 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 379 flow [2025-03-09 00:56:19,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=379, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-03-09 00:56:19,847 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2025-03-09 00:56:19,847 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 379 flow [2025-03-09 00:56:19,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 00:56:19,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:19,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:19,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:56:19,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:19,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1950453345, now seen corresponding path program 3 times [2025-03-09 00:56:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:19,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-03-09 00:56:19,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:56:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:19,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-03-09 00:56:19,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 00:56:19,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 00:56:19,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:19,923 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 00:56:19,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:19,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-03-09 00:56:19,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561370982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:19,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:19,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:56:19,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087978850] [2025-03-09 00:56:19,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:19,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:56:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:19,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:56:19,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:56:19,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:19,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 00:56:19,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:19,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:19,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:20,151 INFO L124 PetriNetUnfolderBase]: 445/836 cut-off events. [2025-03-09 00:56:20,152 INFO L125 PetriNetUnfolderBase]: For 4864/4882 co-relation queries the response was YES. [2025-03-09 00:56:20,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 836 events. 445/836 cut-off events. For 4864/4882 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3772 event pairs, 71 based on Foata normal form. 63/896 useless extension candidates. Maximal degree in co-relation 3134. Up to 223 conditions per place. [2025-03-09 00:56:20,157 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 44 selfloop transitions, 20 changer transitions 31/99 dead transitions. [2025-03-09 00:56:20,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 899 flow [2025-03-09 00:56:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:56:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 00:56:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-03-09 00:56:20,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-09 00:56:20,160 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 379 flow. Second operand 10 states and 155 transitions. [2025-03-09 00:56:20,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 899 flow [2025-03-09 00:56:20,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 99 transitions, 830 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-03-09 00:56:20,171 INFO L231 Difference]: Finished difference. Result has 73 places, 47 transitions, 427 flow [2025-03-09 00:56:20,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=427, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2025-03-09 00:56:20,173 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2025-03-09 00:56:20,173 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 47 transitions, 427 flow [2025-03-09 00:56:20,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 00:56:20,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:20,174 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:20,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:56:20,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:20,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1345523814, now seen corresponding path program 1 times [2025-03-09 00:56:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902527642] [2025-03-09 00:56:20,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:20,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:56:20,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:56:20,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:20,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:20,267 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 00:56:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902527642] [2025-03-09 00:56:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902527642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:20,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:20,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:56:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33834244] [2025-03-09 00:56:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:20,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:56:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:20,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:56:20,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:56:20,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:20,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 47 transitions, 427 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 00:56:20,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:20,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:20,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:20,477 INFO L124 PetriNetUnfolderBase]: 454/845 cut-off events. [2025-03-09 00:56:20,478 INFO L125 PetriNetUnfolderBase]: For 5578/5596 co-relation queries the response was YES. [2025-03-09 00:56:20,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3316 conditions, 845 events. 454/845 cut-off events. For 5578/5596 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3810 event pairs, 59 based on Foata normal form. 36/878 useless extension candidates. Maximal degree in co-relation 3284. Up to 157 conditions per place. [2025-03-09 00:56:20,482 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 45 selfloop transitions, 26 changer transitions 23/98 dead transitions. [2025-03-09 00:56:20,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 98 transitions, 921 flow [2025-03-09 00:56:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:56:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 00:56:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-03-09 00:56:20,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-09 00:56:20,488 INFO L175 Difference]: Start difference. First operand has 73 places, 47 transitions, 427 flow. Second operand 10 states and 155 transitions. [2025-03-09 00:56:20,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 98 transitions, 921 flow [2025-03-09 00:56:20,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 839 flow, removed 25 selfloop flow, removed 8 redundant places. [2025-03-09 00:56:20,498 INFO L231 Difference]: Finished difference. Result has 75 places, 50 transitions, 501 flow [2025-03-09 00:56:20,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=501, PETRI_PLACES=75, PETRI_TRANSITIONS=50} [2025-03-09 00:56:20,498 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2025-03-09 00:56:20,499 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 50 transitions, 501 flow [2025-03-09 00:56:20,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 00:56:20,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:20,499 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:20,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:56:20,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:20,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1611396395, now seen corresponding path program 1 times [2025-03-09 00:56:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183279210] [2025-03-09 00:56:20,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:20,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:56:20,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:56:20,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:20,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:20,630 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 00:56:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183279210] [2025-03-09 00:56:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183279210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:20,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:20,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:56:20,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890222906] [2025-03-09 00:56:20,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:20,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:56:20,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:20,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:56:20,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:56:20,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:20,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 50 transitions, 501 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 00:56:20,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:20,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:20,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:20,893 INFO L124 PetriNetUnfolderBase]: 490/917 cut-off events. [2025-03-09 00:56:20,893 INFO L125 PetriNetUnfolderBase]: For 7027/7045 co-relation queries the response was YES. [2025-03-09 00:56:20,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 917 events. 490/917 cut-off events. For 7027/7045 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4218 event pairs, 161 based on Foata normal form. 45/961 useless extension candidates. Maximal degree in co-relation 3734. Up to 540 conditions per place. [2025-03-09 00:56:20,900 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 56 selfloop transitions, 13 changer transitions 31/104 dead transitions. [2025-03-09 00:56:20,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 1047 flow [2025-03-09 00:56:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:56:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 00:56:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2025-03-09 00:56:20,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2025-03-09 00:56:20,904 INFO L175 Difference]: Start difference. First operand has 75 places, 50 transitions, 501 flow. Second operand 11 states and 168 transitions. [2025-03-09 00:56:20,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 1047 flow [2025-03-09 00:56:20,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 969 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-03-09 00:56:20,917 INFO L231 Difference]: Finished difference. Result has 81 places, 52 transitions, 519 flow [2025-03-09 00:56:20,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=519, PETRI_PLACES=81, PETRI_TRANSITIONS=52} [2025-03-09 00:56:20,918 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2025-03-09 00:56:20,918 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 52 transitions, 519 flow [2025-03-09 00:56:20,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 00:56:20,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:20,918 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:20,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:56:20,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:20,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash -833258891, now seen corresponding path program 2 times [2025-03-09 00:56:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464739465] [2025-03-09 00:56:20,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:56:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:20,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:56:20,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:56:20,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:56:20,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:21,036 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 00:56:21,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:21,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464739465] [2025-03-09 00:56:21,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464739465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:21,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:21,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:56:21,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844659475] [2025-03-09 00:56:21,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:21,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:56:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:21,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:56:21,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:56:21,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:21,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 52 transitions, 519 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 00:56:21,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:21,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:21,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:21,315 INFO L124 PetriNetUnfolderBase]: 643/1211 cut-off events. [2025-03-09 00:56:21,316 INFO L125 PetriNetUnfolderBase]: For 12283/12301 co-relation queries the response was YES. [2025-03-09 00:56:21,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 1211 events. 643/1211 cut-off events. For 12283/12301 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5898 event pairs, 134 based on Foata normal form. 45/1255 useless extension candidates. Maximal degree in co-relation 5327. Up to 465 conditions per place. [2025-03-09 00:56:21,323 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 76 selfloop transitions, 23 changer transitions 31/134 dead transitions. [2025-03-09 00:56:21,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 134 transitions, 1387 flow [2025-03-09 00:56:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:56:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 00:56:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 232 transitions. [2025-03-09 00:56:21,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 00:56:21,325 INFO L175 Difference]: Start difference. First operand has 81 places, 52 transitions, 519 flow. Second operand 15 states and 232 transitions. [2025-03-09 00:56:21,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 134 transitions, 1387 flow [2025-03-09 00:56:21,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 134 transitions, 1219 flow, removed 73 selfloop flow, removed 8 redundant places. [2025-03-09 00:56:21,340 INFO L231 Difference]: Finished difference. Result has 91 places, 58 transitions, 635 flow [2025-03-09 00:56:21,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=635, PETRI_PLACES=91, PETRI_TRANSITIONS=58} [2025-03-09 00:56:21,341 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2025-03-09 00:56:21,341 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 58 transitions, 635 flow [2025-03-09 00:56:21,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 00:56:21,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:21,342 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:21,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:56:21,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:21,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash -836826767, now seen corresponding path program 3 times [2025-03-09 00:56:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605563468] [2025-03-09 00:56:21,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:56:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:21,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:56:21,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:56:21,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 00:56:21,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:21,456 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 00:56:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605563468] [2025-03-09 00:56:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605563468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:21,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:56:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197675808] [2025-03-09 00:56:21,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:21,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:56:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:21,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:56:21,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:56:21,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:21,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 58 transitions, 635 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 00:56:21,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:21,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:21,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:21,722 INFO L124 PetriNetUnfolderBase]: 580/1094 cut-off events. [2025-03-09 00:56:21,723 INFO L125 PetriNetUnfolderBase]: For 12793/12811 co-relation queries the response was YES. [2025-03-09 00:56:21,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5016 conditions, 1094 events. 580/1094 cut-off events. For 12793/12811 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5248 event pairs, 140 based on Foata normal form. 63/1156 useless extension candidates. Maximal degree in co-relation 4976. Up to 435 conditions per place. [2025-03-09 00:56:21,729 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 24 changer transitions 39/131 dead transitions. [2025-03-09 00:56:21,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 131 transitions, 1443 flow [2025-03-09 00:56:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:56:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 00:56:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 215 transitions. [2025-03-09 00:56:21,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5295566502463054 [2025-03-09 00:56:21,731 INFO L175 Difference]: Start difference. First operand has 91 places, 58 transitions, 635 flow. Second operand 14 states and 215 transitions. [2025-03-09 00:56:21,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 131 transitions, 1443 flow [2025-03-09 00:56:21,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 131 transitions, 1275 flow, removed 68 selfloop flow, removed 10 redundant places. [2025-03-09 00:56:21,749 INFO L231 Difference]: Finished difference. Result has 96 places, 59 transitions, 638 flow [2025-03-09 00:56:21,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=638, PETRI_PLACES=96, PETRI_TRANSITIONS=59} [2025-03-09 00:56:21,749 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2025-03-09 00:56:21,749 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 59 transitions, 638 flow [2025-03-09 00:56:21,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 00:56:21,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:21,750 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:21,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:56:21,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:21,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1779029952, now seen corresponding path program 1 times [2025-03-09 00:56:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788786271] [2025-03-09 00:56:21,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:21,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 00:56:21,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 00:56:21,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:21,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788786271] [2025-03-09 00:56:21,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788786271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933898611] [2025-03-09 00:56:21,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:21,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:21,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:21,866 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 00:56:21,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 00:56:21,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 00:56:21,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 00:56:21,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:21,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:21,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:56:21,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:22,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933898611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:22,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-09 00:56:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835023896] [2025-03-09 00:56:22,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:22,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:56:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:22,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:56:22,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:56:22,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:22,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 59 transitions, 638 flow. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 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 00:56:22,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:22,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:22,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:22,725 INFO L124 PetriNetUnfolderBase]: 877/1649 cut-off events. [2025-03-09 00:56:22,726 INFO L125 PetriNetUnfolderBase]: For 24500/24518 co-relation queries the response was YES. [2025-03-09 00:56:22,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8250 conditions, 1649 events. 877/1649 cut-off events. For 24500/24518 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8074 event pairs, 65 based on Foata normal form. 81/1727 useless extension candidates. Maximal degree in co-relation 8208. Up to 312 conditions per place. [2025-03-09 00:56:22,738 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 91 selfloop transitions, 46 changer transitions 67/208 dead transitions. [2025-03-09 00:56:22,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 208 transitions, 2376 flow [2025-03-09 00:56:22,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 00:56:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-09 00:56:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 384 transitions. [2025-03-09 00:56:22,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296551724137931 [2025-03-09 00:56:22,740 INFO L175 Difference]: Start difference. First operand has 96 places, 59 transitions, 638 flow. Second operand 25 states and 384 transitions. [2025-03-09 00:56:22,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 208 transitions, 2376 flow [2025-03-09 00:56:22,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 208 transitions, 2192 flow, removed 72 selfloop flow, removed 12 redundant places. [2025-03-09 00:56:22,769 INFO L231 Difference]: Finished difference. Result has 120 places, 69 transitions, 965 flow [2025-03-09 00:56:22,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=965, PETRI_PLACES=120, PETRI_TRANSITIONS=69} [2025-03-09 00:56:22,770 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 90 predicate places. [2025-03-09 00:56:22,770 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 69 transitions, 965 flow [2025-03-09 00:56:22,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 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 00:56:22,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:22,770 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:22,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:22,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 00:56:22,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:22,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:22,972 INFO L85 PathProgramCache]: Analyzing trace with hash -230915460, now seen corresponding path program 2 times [2025-03-09 00:56:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:22,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448999253] [2025-03-09 00:56:22,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:56:22,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:22,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 00:56:22,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 00:56:22,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:56:22,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:23,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448999253] [2025-03-09 00:56:23,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448999253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:23,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804999117] [2025-03-09 00:56:23,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:56:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:23,086 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 00:56:23,088 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 00:56:23,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 00:56:23,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 00:56:23,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:56:23,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:23,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:56:23,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:23,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:23,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804999117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:23,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-09 00:56:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811412347] [2025-03-09 00:56:23,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:23,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:56:23,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:23,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:56:23,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:56:23,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:23,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 69 transitions, 965 flow. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 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 00:56:23,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:23,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:23,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:23,975 INFO L124 PetriNetUnfolderBase]: 1021/1931 cut-off events. [2025-03-09 00:56:23,976 INFO L125 PetriNetUnfolderBase]: For 63293/63311 co-relation queries the response was YES. [2025-03-09 00:56:23,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12119 conditions, 1931 events. 1021/1931 cut-off events. For 63293/63311 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9609 event pairs, 38 based on Foata normal form. 126/2056 useless extension candidates. Maximal degree in co-relation 12065. Up to 390 conditions per place. [2025-03-09 00:56:23,990 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 91 selfloop transitions, 63 changer transitions 98/256 dead transitions. [2025-03-09 00:56:23,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 256 transitions, 3882 flow [2025-03-09 00:56:23,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 00:56:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-09 00:56:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 459 transitions. [2025-03-09 00:56:23,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2025-03-09 00:56:23,993 INFO L175 Difference]: Start difference. First operand has 120 places, 69 transitions, 965 flow. Second operand 30 states and 459 transitions. [2025-03-09 00:56:23,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 256 transitions, 3882 flow [2025-03-09 00:56:24,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 256 transitions, 3122 flow, removed 346 selfloop flow, removed 19 redundant places. [2025-03-09 00:56:24,038 INFO L231 Difference]: Finished difference. Result has 142 places, 87 transitions, 1383 flow [2025-03-09 00:56:24,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1383, PETRI_PLACES=142, PETRI_TRANSITIONS=87} [2025-03-09 00:56:24,039 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2025-03-09 00:56:24,040 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 87 transitions, 1383 flow [2025-03-09 00:56:24,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 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 00:56:24,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:24,040 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:24,046 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 00:56:24,244 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,SelfDestructingSolverStorable12 [2025-03-09 00:56:24,244 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:24,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:24,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2049794340, now seen corresponding path program 3 times [2025-03-09 00:56:24,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:24,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930794511] [2025-03-09 00:56:24,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:56:24,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:24,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-03-09 00:56:24,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:24,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 00:56:24,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:24,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:24,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930794511] [2025-03-09 00:56:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930794511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:24,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027023992] [2025-03-09 00:56:24,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:56:24,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:24,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:24,398 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 00:56:24,399 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 00:56:24,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-03-09 00:56:24,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:24,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 00:56:24,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:24,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 00:56:24,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:24,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:24,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027023992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:24,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:24,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-09 00:56:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330403358] [2025-03-09 00:56:24,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:24,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:56:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:24,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:56:24,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:56:24,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:24,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 87 transitions, 1383 flow. Second operand has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 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 00:56:24,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:24,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:24,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:26,114 INFO L124 PetriNetUnfolderBase]: 1669/3072 cut-off events. [2025-03-09 00:56:26,114 INFO L125 PetriNetUnfolderBase]: For 142770/142776 co-relation queries the response was YES. [2025-03-09 00:56:26,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22092 conditions, 3072 events. 1669/3072 cut-off events. For 142770/142776 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 15153 event pairs, 42 based on Foata normal form. 96/3167 useless extension candidates. Maximal degree in co-relation 22029. Up to 648 conditions per place. [2025-03-09 00:56:26,145 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 141 selfloop transitions, 109 changer transitions 135/389 dead transitions. [2025-03-09 00:56:26,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 389 transitions, 6740 flow [2025-03-09 00:56:26,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 00:56:26,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-09 00:56:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 703 transitions. [2025-03-09 00:56:26,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5269865067466267 [2025-03-09 00:56:26,149 INFO L175 Difference]: Start difference. First operand has 142 places, 87 transitions, 1383 flow. Second operand 46 states and 703 transitions. [2025-03-09 00:56:26,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 389 transitions, 6740 flow [2025-03-09 00:56:26,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 389 transitions, 5582 flow, removed 542 selfloop flow, removed 21 redundant places. [2025-03-09 00:56:26,278 INFO L231 Difference]: Finished difference. Result has 186 places, 133 transitions, 2467 flow [2025-03-09 00:56:26,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2467, PETRI_PLACES=186, PETRI_TRANSITIONS=133} [2025-03-09 00:56:26,279 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2025-03-09 00:56:26,282 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 133 transitions, 2467 flow [2025-03-09 00:56:26,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 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 00:56:26,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:26,282 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:26,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:56:26,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:26,483 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:26,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash -280336807, now seen corresponding path program 4 times [2025-03-09 00:56:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:26,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820046324] [2025-03-09 00:56:26,484 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:56:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:26,489 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-09 00:56:26,495 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 00:56:26,495 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:56:26,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:26,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820046324] [2025-03-09 00:56:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820046324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050239975] [2025-03-09 00:56:26,804 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:56:26,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:26,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:26,806 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 00:56:26,808 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 00:56:26,840 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-09 00:56:26,855 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 00:56:26,855 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:56:26,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:26,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 00:56:26,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:26,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:27,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050239975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:27,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:27,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2025-03-09 00:56:27,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911620608] [2025-03-09 00:56:27,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:27,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 00:56:27,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:27,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 00:56:27,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 00:56:27,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:27,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 133 transitions, 2467 flow. Second operand has 35 states, 35 states have (on average 10.028571428571428) internal successors, (351), 35 states have internal predecessors, (351), 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 00:56:27,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:27,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:27,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:29,080 INFO L124 PetriNetUnfolderBase]: 2191/4209 cut-off events. [2025-03-09 00:56:29,080 INFO L125 PetriNetUnfolderBase]: For 387070/387076 co-relation queries the response was YES. [2025-03-09 00:56:29,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38074 conditions, 4209 events. 2191/4209 cut-off events. For 387070/387076 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 21794 event pairs, 403 based on Foata normal form. 159/4365 useless extension candidates. Maximal degree in co-relation 37995. Up to 1447 conditions per place. [2025-03-09 00:56:29,113 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 187 selfloop transitions, 100 changer transitions 189/480 dead transitions. [2025-03-09 00:56:29,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 480 transitions, 11368 flow [2025-03-09 00:56:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-09 00:56:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-03-09 00:56:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 818 transitions. [2025-03-09 00:56:29,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5128526645768025 [2025-03-09 00:56:29,115 INFO L175 Difference]: Start difference. First operand has 186 places, 133 transitions, 2467 flow. Second operand 55 states and 818 transitions. [2025-03-09 00:56:29,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 480 transitions, 11368 flow [2025-03-09 00:56:29,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 480 transitions, 9135 flow, removed 1093 selfloop flow, removed 21 redundant places. [2025-03-09 00:56:29,436 INFO L231 Difference]: Finished difference. Result has 242 places, 177 transitions, 3503 flow [2025-03-09 00:56:29,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3503, PETRI_PLACES=242, PETRI_TRANSITIONS=177} [2025-03-09 00:56:29,437 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2025-03-09 00:56:29,437 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 177 transitions, 3503 flow [2025-03-09 00:56:29,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.028571428571428) internal successors, (351), 35 states have internal predecessors, (351), 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 00:56:29,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:29,438 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:29,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:29,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 00:56:29,638 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:29,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash -905275549, now seen corresponding path program 5 times [2025-03-09 00:56:29,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:29,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794921166] [2025-03-09 00:56:29,639 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 00:56:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:29,643 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 6 equivalence classes. [2025-03-09 00:56:29,650 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 00:56:29,650 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 00:56:29,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:29,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794921166] [2025-03-09 00:56:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794921166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000994399] [2025-03-09 00:56:29,890 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 00:56:29,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:29,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:29,892 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 00:56:29,894 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 00:56:29,924 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 6 equivalence classes. [2025-03-09 00:56:29,939 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 00:56:29,939 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 00:56:29,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:29,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 00:56:29,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:30,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:30,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000994399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:30,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:30,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2025-03-09 00:56:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084062625] [2025-03-09 00:56:30,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:30,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 00:56:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:30,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 00:56:30,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 00:56:30,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:30,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 177 transitions, 3503 flow. Second operand has 36 states, 36 states have (on average 10.083333333333334) internal successors, (363), 36 states have internal predecessors, (363), 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 00:56:30,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:30,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:30,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:32,806 INFO L124 PetriNetUnfolderBase]: 2740/5462 cut-off events. [2025-03-09 00:56:32,806 INFO L125 PetriNetUnfolderBase]: For 865573/865579 co-relation queries the response was YES. [2025-03-09 00:56:32,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57397 conditions, 5462 events. 2740/5462 cut-off events. For 865573/865579 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 30837 event pairs, 194 based on Foata normal form. 159/5620 useless extension candidates. Maximal degree in co-relation 57297. Up to 1308 conditions per place. [2025-03-09 00:56:32,846 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 179 selfloop transitions, 190 changer transitions 201/574 dead transitions. [2025-03-09 00:56:32,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 574 transitions, 15293 flow [2025-03-09 00:56:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-09 00:56:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-03-09 00:56:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 913 transitions. [2025-03-09 00:56:32,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161107970604861 [2025-03-09 00:56:32,848 INFO L175 Difference]: Start difference. First operand has 242 places, 177 transitions, 3503 flow. Second operand 61 states and 913 transitions. [2025-03-09 00:56:32,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 574 transitions, 15293 flow [2025-03-09 00:56:33,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 574 transitions, 12806 flow, removed 1210 selfloop flow, removed 29 redundant places. [2025-03-09 00:56:33,503 INFO L231 Difference]: Finished difference. Result has 292 places, 238 transitions, 5297 flow [2025-03-09 00:56:33,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2636, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=5297, PETRI_PLACES=292, PETRI_TRANSITIONS=238} [2025-03-09 00:56:33,504 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 262 predicate places. [2025-03-09 00:56:33,504 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 238 transitions, 5297 flow [2025-03-09 00:56:33,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.083333333333334) internal successors, (363), 36 states have internal predecessors, (363), 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 00:56:33,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:33,504 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:33,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:56:33,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 00:56:33,705 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:33,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1561587135, now seen corresponding path program 6 times [2025-03-09 00:56:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:33,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370849803] [2025-03-09 00:56:33,706 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 00:56:33,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:33,711 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 7 equivalence classes. [2025-03-09 00:56:33,718 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 00:56:33,718 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-09 00:56:33,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370849803] [2025-03-09 00:56:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370849803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456044656] [2025-03-09 00:56:33,904 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 00:56:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:33,906 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 00:56:33,908 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 00:56:33,936 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 7 equivalence classes. [2025-03-09 00:56:33,951 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 00:56:33,951 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-09 00:56:33,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:33,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 00:56:33,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:34,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:34,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456044656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:34,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:34,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2025-03-09 00:56:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593780511] [2025-03-09 00:56:34,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:34,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 00:56:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:34,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 00:56:34,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 00:56:34,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:34,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 238 transitions, 5297 flow. Second operand has 35 states, 35 states have (on average 10.057142857142857) internal successors, (352), 35 states have internal predecessors, (352), 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 00:56:34,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:34,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:34,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:37,226 INFO L124 PetriNetUnfolderBase]: 3667/7255 cut-off events. [2025-03-09 00:56:37,226 INFO L125 PetriNetUnfolderBase]: For 1744516/1744522 co-relation queries the response was YES. [2025-03-09 00:56:37,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90390 conditions, 7255 events. 3667/7255 cut-off events. For 1744516/1744522 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 42335 event pairs, 83 based on Foata normal form. 159/7411 useless extension candidates. Maximal degree in co-relation 90270. Up to 1746 conditions per place. [2025-03-09 00:56:37,310 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 225 selfloop transitions, 271 changer transitions 205/705 dead transitions. [2025-03-09 00:56:37,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 705 transitions, 22089 flow [2025-03-09 00:56:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-09 00:56:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2025-03-09 00:56:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 1081 transitions. [2025-03-09 00:56:37,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5250121418164158 [2025-03-09 00:56:37,313 INFO L175 Difference]: Start difference. First operand has 292 places, 238 transitions, 5297 flow. Second operand 71 states and 1081 transitions. [2025-03-09 00:56:37,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 705 transitions, 22089 flow [2025-03-09 00:56:38,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 705 transitions, 18302 flow, removed 1848 selfloop flow, removed 31 redundant places. [2025-03-09 00:56:38,571 INFO L231 Difference]: Finished difference. Result has 356 places, 299 transitions, 7612 flow [2025-03-09 00:56:38,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3894, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=7612, PETRI_PLACES=356, PETRI_TRANSITIONS=299} [2025-03-09 00:56:38,571 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 326 predicate places. [2025-03-09 00:56:38,571 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 299 transitions, 7612 flow [2025-03-09 00:56:38,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.057142857142857) internal successors, (352), 35 states have internal predecessors, (352), 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 00:56:38,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:38,572 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:38,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:38,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 00:56:38,772 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:38,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1035992735, now seen corresponding path program 7 times [2025-03-09 00:56:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:38,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134428735] [2025-03-09 00:56:38,773 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 00:56:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:38,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 00:56:38,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 00:56:38,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:38,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:39,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:39,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134428735] [2025-03-09 00:56:39,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134428735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:39,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418337586] [2025-03-09 00:56:39,066 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 00:56:39,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:39,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:39,071 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:39,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:56:39,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 00:56:39,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 00:56:39,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:39,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:39,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 00:56:39,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:39,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:39,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418337586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:39,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:39,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2025-03-09 00:56:39,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187380907] [2025-03-09 00:56:39,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:39,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-09 00:56:39,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:39,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-09 00:56:39,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1519, Unknown=0, NotChecked=0, Total=1980 [2025-03-09 00:56:39,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:39,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 299 transitions, 7612 flow. Second operand has 45 states, 45 states have (on average 10.044444444444444) internal successors, (452), 45 states have internal predecessors, (452), 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 00:56:39,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:39,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:39,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:44,638 INFO L124 PetriNetUnfolderBase]: 5422/10670 cut-off events. [2025-03-09 00:56:44,639 INFO L125 PetriNetUnfolderBase]: For 4096774/4096780 co-relation queries the response was YES. [2025-03-09 00:56:44,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162123 conditions, 10670 events. 5422/10670 cut-off events. For 4096774/4096780 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 63824 event pairs, 66 based on Foata normal form. 393/11062 useless extension candidates. Maximal degree in co-relation 161977. Up to 2580 conditions per place. [2025-03-09 00:56:44,788 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 312 selfloop transitions, 400 changer transitions 341/1057 dead transitions. [2025-03-09 00:56:44,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 1057 transitions, 42459 flow [2025-03-09 00:56:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-03-09 00:56:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-03-09 00:56:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1599 transitions. [2025-03-09 00:56:44,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5251231527093596 [2025-03-09 00:56:44,791 INFO L175 Difference]: Start difference. First operand has 356 places, 299 transitions, 7612 flow. Second operand 105 states and 1599 transitions. [2025-03-09 00:56:44,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 1057 transitions, 42459 flow [2025-03-09 00:56:47,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 1057 transitions, 32333 flow, removed 4971 selfloop flow, removed 36 redundant places. [2025-03-09 00:56:47,967 INFO L231 Difference]: Finished difference. Result has 471 places, 430 transitions, 12645 flow [2025-03-09 00:56:47,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=5282, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=12645, PETRI_PLACES=471, PETRI_TRANSITIONS=430} [2025-03-09 00:56:47,968 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 441 predicate places. [2025-03-09 00:56:47,968 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 430 transitions, 12645 flow [2025-03-09 00:56:47,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.044444444444444) internal successors, (452), 45 states have internal predecessors, (452), 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 00:56:47,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:47,968 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:47,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:48,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:48,169 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:56:48,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 364186717, now seen corresponding path program 8 times [2025-03-09 00:56:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13398646] [2025-03-09 00:56:48,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:56:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:48,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-09 00:56:48,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 00:56:48,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:56:48,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 0 proven. 796 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:56:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13398646] [2025-03-09 00:56:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13398646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548674469] [2025-03-09 00:56:48,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:56:48,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:48,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:48,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:48,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:56:48,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-09 00:56:48,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 00:56:48,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:56:48,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:48,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 00:56:48,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 0 proven. 796 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:56:49,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 0 proven. 796 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:56:49,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548674469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:49,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:49,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2025-03-09 00:56:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697642109] [2025-03-09 00:56:49,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:49,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-03-09 00:56:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:49,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-03-09 00:56:49,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1362, Invalid=4644, Unknown=0, NotChecked=0, Total=6006 [2025-03-09 00:56:49,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:56:49,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 430 transitions, 12645 flow. Second operand has 78 states, 78 states have (on average 10.064102564102564) internal successors, (785), 78 states have internal predecessors, (785), 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 00:56:49,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:49,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:56:49,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:57,213 INFO L124 PetriNetUnfolderBase]: 7501/14368 cut-off events. [2025-03-09 00:56:57,214 INFO L125 PetriNetUnfolderBase]: For 7834711/7834717 co-relation queries the response was YES. [2025-03-09 00:56:57,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240287 conditions, 14368 events. 7501/14368 cut-off events. For 7834711/7834717 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 86336 event pairs, 65 based on Foata normal form. 60/14425 useless extension candidates. Maximal degree in co-relation 240095. Up to 3402 conditions per place. [2025-03-09 00:56:57,411 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 311 selfloop transitions, 575 changer transitions 195/1085 dead transitions. [2025-03-09 00:56:57,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 1085 transitions, 47480 flow [2025-03-09 00:56:57,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-09 00:56:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-03-09 00:56:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 1299 transitions. [2025-03-09 00:56:57,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208500400962309 [2025-03-09 00:56:57,414 INFO L175 Difference]: Start difference. First operand has 471 places, 430 transitions, 12645 flow. Second operand 86 states and 1299 transitions. [2025-03-09 00:56:57,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 1085 transitions, 47480 flow [2025-03-09 00:57:14,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 1085 transitions, 29916 flow, removed 8595 selfloop flow, removed 57 redundant places. [2025-03-09 00:57:14,089 INFO L231 Difference]: Finished difference. Result has 496 places, 611 transitions, 13619 flow [2025-03-09 00:57:14,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=7777, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=399, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=13619, PETRI_PLACES=496, PETRI_TRANSITIONS=611} [2025-03-09 00:57:14,090 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 466 predicate places. [2025-03-09 00:57:14,090 INFO L471 AbstractCegarLoop]: Abstraction has has 496 places, 611 transitions, 13619 flow [2025-03-09 00:57:14,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 10.064102564102564) internal successors, (785), 78 states have internal predecessors, (785), 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 00:57:14,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:14,091 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:14,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:57:14,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:14,292 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:57:14,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1390842362, now seen corresponding path program 9 times [2025-03-09 00:57:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:14,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236565390] [2025-03-09 00:57:14,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:57:14,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:14,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 14 equivalence classes. [2025-03-09 00:57:14,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 00:57:14,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-09 00:57:14,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:15,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:15,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236565390] [2025-03-09 00:57:15,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236565390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:15,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497783895] [2025-03-09 00:57:15,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:57:15,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:15,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:15,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:15,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:57:15,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 14 equivalence classes. [2025-03-09 00:57:15,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 00:57:15,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-09 00:57:15,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:15,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 00:57:15,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 1 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:15,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:57:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:15,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497783895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:57:15,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:57:15,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 45 [2025-03-09 00:57:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693545338] [2025-03-09 00:57:15,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:57:15,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-09 00:57:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:15,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-09 00:57:15,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=1636, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 00:57:15,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:57:15,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 611 transitions, 13619 flow. Second operand has 46 states, 46 states have (on average 9.978260869565217) internal successors, (459), 46 states have internal predecessors, (459), 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 00:57:15,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:15,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:57:15,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:22,069 INFO L124 PetriNetUnfolderBase]: 7501/14411 cut-off events. [2025-03-09 00:57:22,069 INFO L125 PetriNetUnfolderBase]: For 6485440/6485446 co-relation queries the response was YES. [2025-03-09 00:57:22,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202409 conditions, 14411 events. 7501/14411 cut-off events. For 6485440/6485446 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 86589 event pairs, 38 based on Foata normal form. 33/14443 useless extension candidates. Maximal degree in co-relation 202220. Up to 3420 conditions per place. [2025-03-09 00:57:22,669 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 323 selfloop transitions, 584 changer transitions 183/1094 dead transitions. [2025-03-09 00:57:22,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 1094 transitions, 32348 flow [2025-03-09 00:57:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-03-09 00:57:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2025-03-09 00:57:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1323 transitions. [2025-03-09 00:57:22,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5184169278996865 [2025-03-09 00:57:22,671 INFO L175 Difference]: Start difference. First operand has 496 places, 611 transitions, 13619 flow. Second operand 88 states and 1323 transitions. [2025-03-09 00:57:22,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 1094 transitions, 32348 flow [2025-03-09 00:57:40,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 1094 transitions, 29108 flow, removed 1453 selfloop flow, removed 38 redundant places. [2025-03-09 00:57:40,747 INFO L231 Difference]: Finished difference. Result has 545 places, 618 transitions, 12902 flow [2025-03-09 00:57:40,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=11149, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=577, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=12902, PETRI_PLACES=545, PETRI_TRANSITIONS=618} [2025-03-09 00:57:40,748 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 515 predicate places. [2025-03-09 00:57:40,748 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 618 transitions, 12902 flow [2025-03-09 00:57:40,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 9.978260869565217) internal successors, (459), 46 states have internal predecessors, (459), 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 00:57:40,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:40,748 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:40,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:57:40,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:40,949 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:57:40,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1790796690, now seen corresponding path program 10 times [2025-03-09 00:57:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:40,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309327634] [2025-03-09 00:57:40,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:57:40,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:40,959 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 130 statements into 2 equivalence classes. [2025-03-09 00:57:40,969 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 00:57:40,969 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:57:40,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 0 proven. 941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:41,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:41,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309327634] [2025-03-09 00:57:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309327634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:41,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438898715] [2025-03-09 00:57:41,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:57:41,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:41,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:41,658 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:41,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:57:41,695 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 130 statements into 2 equivalence classes. [2025-03-09 00:57:41,719 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 00:57:41,720 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:57:41,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:41,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 00:57:41,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 0 proven. 941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:41,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:57:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 0 proven. 941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438898715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:57:42,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:57:42,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2025-03-09 00:57:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104022793] [2025-03-09 00:57:42,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:57:42,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-09 00:57:42,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:42,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-09 00:57:42,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2025-03-09 00:57:42,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 00:57:42,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 618 transitions, 12902 flow. Second operand has 45 states, 45 states have (on average 9.955555555555556) internal successors, (448), 45 states have internal predecessors, (448), 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 00:57:42,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:42,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 00:57:42,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand