./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:25:45,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:25:45,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:25:45,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:25:45,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:25:45,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:25:45,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:25:45,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:25:45,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:25:45,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:25:45,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:25:45,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:25:45,215 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:25:45,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:25:45,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:25:45,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:25:45,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:25:45,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:25:45,217 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2025-03-17 14:25:45,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:25:45,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:25:45,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:25:45,460 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:25:45,460 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:25:45,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-03-17 14:25:46,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf2f1c20/900a278285744c9686eb4ec3e0514f72/FLAG357156406 [2025-03-17 14:25:46,801 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:25:46,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-03-17 14:25:46,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf2f1c20/900a278285744c9686eb4ec3e0514f72/FLAG357156406 [2025-03-17 14:25:47,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf2f1c20/900a278285744c9686eb4ec3e0514f72 [2025-03-17 14:25:47,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:25:47,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:25:47,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:25:47,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:25:47,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:25:47,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5948f52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47, skipping insertion in model container [2025-03-17 14:25:47,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:25:47,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:25:47,263 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:25:47,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:25:47,292 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:25:47,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47 WrapperNode [2025-03-17 14:25:47,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:25:47,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:25:47,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:25:47,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:25:47,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,317 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2025-03-17 14:25:47,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:25:47,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:25:47,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:25:47,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:25:47,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,331 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-17 14:25:47,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:25:47,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:25:47,338 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:25:47,338 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:25:47,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (1/1) ... [2025-03-17 14:25:47,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:25:47,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:47,366 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-17 14:25:47,369 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-17 14:25:47,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:25:47,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:25:47,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:25:47,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:25:47,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:25:47,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:25:47,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:25:47,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:25:47,385 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:25:47,439 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:25:47,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:25:47,559 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:25:47,559 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:25:47,657 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:25:47,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:25:47,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:25:47 BoogieIcfgContainer [2025-03-17 14:25:47,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:25:47,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:25:47,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:25:47,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:25:47,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:25:47" (1/3) ... [2025-03-17 14:25:47,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c72f5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:25:47, skipping insertion in model container [2025-03-17 14:25:47,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:47" (2/3) ... [2025-03-17 14:25:47,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c72f5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:25:47, skipping insertion in model container [2025-03-17 14:25:47,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:25:47" (3/3) ... [2025-03-17 14:25:47,667 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-03-17 14:25:47,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:25:47,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-17 14:25:47,678 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:25:47,714 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:25:47,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 82 flow [2025-03-17 14:25:47,761 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-03-17 14:25:47,763 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:25:47,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 4/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-17 14:25:47,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 34 transitions, 82 flow [2025-03-17 14:25:47,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 31 transitions, 74 flow [2025-03-17 14:25:47,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:25:47,780 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;@7d833283, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:25:47,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 14:25:47,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:25:47,791 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-17 14:25:47,791 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:25:47,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:47,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:47,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:47,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1023084607, now seen corresponding path program 1 times [2025-03-17 14:25:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406823523] [2025-03-17 14:25:47,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:47,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:47,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:25:47,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:47,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:47,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:48,045 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-17 14:25:48,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406823523] [2025-03-17 14:25:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406823523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:25:48,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364585156] [2025-03-17 14:25:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:48,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:25:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:48,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:25:48,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:25:48,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-03-17 14:25:48,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-17 14:25:48,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:48,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-03-17 14:25:48,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:48,188 INFO L124 PetriNetUnfolderBase]: 146/286 cut-off events. [2025-03-17 14:25:48,188 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-17 14:25:48,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 286 events. 146/286 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1133 event pairs, 12 based on Foata normal form. 2/253 useless extension candidates. Maximal degree in co-relation 458. Up to 186 conditions per place. [2025-03-17 14:25:48,191 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 21 selfloop transitions, 7 changer transitions 1/40 dead transitions. [2025-03-17 14:25:48,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 159 flow [2025-03-17 14:25:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:25:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:25:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-17 14:25:48,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2025-03-17 14:25:48,202 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 74 flow. Second operand 3 states and 73 transitions. [2025-03-17 14:25:48,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 159 flow [2025-03-17 14:25:48,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:25:48,206 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 101 flow [2025-03-17 14:25:48,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2025-03-17 14:25:48,211 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-03-17 14:25:48,211 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 101 flow [2025-03-17 14:25:48,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-17 14:25:48,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:48,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:48,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:25:48,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:48,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash -926764481, now seen corresponding path program 1 times [2025-03-17 14:25:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:48,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967399796] [2025-03-17 14:25:48,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:48,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:25:48,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:25:48,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:48,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:48,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:48,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967399796] [2025-03-17 14:25:48,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967399796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:48,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:48,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:25:48,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117635630] [2025-03-17 14:25:48,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:48,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:48,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:48,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:48,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:48,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:48,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 14:25:48,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:48,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:48,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:48,527 INFO L124 PetriNetUnfolderBase]: 225/415 cut-off events. [2025-03-17 14:25:48,527 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-17 14:25:48,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 415 events. 225/415 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1879 event pairs, 26 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 322. Up to 182 conditions per place. [2025-03-17 14:25:48,531 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 10 changer transitions 5/69 dead transitions. [2025-03-17 14:25:48,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 69 transitions, 326 flow [2025-03-17 14:25:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2025-03-17 14:25:48,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-03-17 14:25:48,534 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 101 flow. Second operand 5 states and 115 transitions. [2025-03-17 14:25:48,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 69 transitions, 326 flow [2025-03-17 14:25:48,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 69 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:48,535 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 155 flow [2025-03-17 14:25:48,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-03-17 14:25:48,536 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-03-17 14:25:48,536 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 155 flow [2025-03-17 14:25:48,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 14:25:48,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:48,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:48,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:25:48,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:48,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1838096637, now seen corresponding path program 2 times [2025-03-17 14:25:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:48,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872679859] [2025-03-17 14:25:48,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:48,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:25:48,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:25:48,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:25:48,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:48,637 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-17 14:25:48,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:48,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872679859] [2025-03-17 14:25:48,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872679859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:48,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:48,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:25:48,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973370410] [2025-03-17 14:25:48,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:48,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:48,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:48,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:48,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:48,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:48,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 14:25:48,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:48,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:48,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:48,760 INFO L124 PetriNetUnfolderBase]: 213/424 cut-off events. [2025-03-17 14:25:48,760 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-03-17 14:25:48,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 424 events. 213/424 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1970 event pairs, 12 based on Foata normal form. 12/402 useless extension candidates. Maximal degree in co-relation 393. Up to 112 conditions per place. [2025-03-17 14:25:48,763 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 44 selfloop transitions, 12 changer transitions 4/69 dead transitions. [2025-03-17 14:25:48,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 382 flow [2025-03-17 14:25:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-03-17 14:25:48,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2025-03-17 14:25:48,764 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 155 flow. Second operand 5 states and 112 transitions. [2025-03-17 14:25:48,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 382 flow [2025-03-17 14:25:48,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 382 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:25:48,766 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 241 flow [2025-03-17 14:25:48,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2025-03-17 14:25:48,767 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2025-03-17 14:25:48,767 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 241 flow [2025-03-17 14:25:48,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 14:25:48,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:48,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:48,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:25:48,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:48,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash 154352448, now seen corresponding path program 1 times [2025-03-17 14:25:48,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:48,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382395861] [2025-03-17 14:25:48,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:48,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:25:48,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:25:48,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:48,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:48,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:48,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382395861] [2025-03-17 14:25:48,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382395861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:48,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:48,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:25:48,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803166915] [2025-03-17 14:25:48,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:48,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:48,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:48,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:48,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:48,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 14:25:48,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:48,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:48,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:48,950 INFO L124 PetriNetUnfolderBase]: 212/413 cut-off events. [2025-03-17 14:25:48,950 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-17 14:25:48,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 413 events. 212/413 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1958 event pairs, 22 based on Foata normal form. 2/372 useless extension candidates. Maximal degree in co-relation 668. Up to 191 conditions per place. [2025-03-17 14:25:48,953 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 52 selfloop transitions, 9 changer transitions 2/72 dead transitions. [2025-03-17 14:25:48,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 482 flow [2025-03-17 14:25:48,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-17 14:25:48,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6529411764705882 [2025-03-17 14:25:48,957 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 241 flow. Second operand 5 states and 111 transitions. [2025-03-17 14:25:48,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 482 flow [2025-03-17 14:25:48,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 478 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-17 14:25:48,963 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 292 flow [2025-03-17 14:25:48,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-03-17 14:25:48,964 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2025-03-17 14:25:48,964 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 292 flow [2025-03-17 14:25:48,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 14:25:48,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:48,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:48,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:25:48,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:48,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1119042460, now seen corresponding path program 2 times [2025-03-17 14:25:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714889332] [2025-03-17 14:25:48,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:48,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:25:48,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:25:48,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:25:48,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:49,041 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-17 14:25:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714889332] [2025-03-17 14:25:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714889332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:25:49,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012645754] [2025-03-17 14:25:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:49,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:49,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:49,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:49,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:49,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 14:25:49,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:49,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:49,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:49,151 INFO L124 PetriNetUnfolderBase]: 201/418 cut-off events. [2025-03-17 14:25:49,151 INFO L125 PetriNetUnfolderBase]: For 835/835 co-relation queries the response was YES. [2025-03-17 14:25:49,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 418 events. 201/418 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1825 event pairs, 10 based on Foata normal form. 17/399 useless extension candidates. Maximal degree in co-relation 896. Up to 117 conditions per place. [2025-03-17 14:25:49,155 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 50 selfloop transitions, 12 changer transitions 1/72 dead transitions. [2025-03-17 14:25:49,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 534 flow [2025-03-17 14:25:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-17 14:25:49,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2025-03-17 14:25:49,156 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 292 flow. Second operand 5 states and 108 transitions. [2025-03-17 14:25:49,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 534 flow [2025-03-17 14:25:49,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 518 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:49,162 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 355 flow [2025-03-17 14:25:49,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-03-17 14:25:49,164 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2025-03-17 14:25:49,164 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 355 flow [2025-03-17 14:25:49,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 14:25:49,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:49,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:49,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:25:49,164 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:49,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:49,164 INFO L85 PathProgramCache]: Analyzing trace with hash -151141392, now seen corresponding path program 1 times [2025-03-17 14:25:49,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:49,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258653909] [2025-03-17 14:25:49,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:49,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:25:49,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:25:49,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:49,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:49,361 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-17 14:25:49,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:49,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258653909] [2025-03-17 14:25:49,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258653909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:49,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:49,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:25:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119498390] [2025-03-17 14:25:49,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:49,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:25:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:49,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:25:49,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:25:49,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 34 [2025-03-17 14:25:49,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-17 14:25:49,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:49,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 34 [2025-03-17 14:25:49,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:49,519 INFO L124 PetriNetUnfolderBase]: 251/511 cut-off events. [2025-03-17 14:25:49,519 INFO L125 PetriNetUnfolderBase]: For 1454/1502 co-relation queries the response was YES. [2025-03-17 14:25:49,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 511 events. 251/511 cut-off events. For 1454/1502 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2373 event pairs, 14 based on Foata normal form. 20/470 useless extension candidates. Maximal degree in co-relation 712. Up to 163 conditions per place. [2025-03-17 14:25:49,522 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 47 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2025-03-17 14:25:49,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 694 flow [2025-03-17 14:25:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:25:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:25:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-17 14:25:49,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6323529411764706 [2025-03-17 14:25:49,523 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 355 flow. Second operand 6 states and 129 transitions. [2025-03-17 14:25:49,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 694 flow [2025-03-17 14:25:49,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 679 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:49,527 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 490 flow [2025-03-17 14:25:49,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-03-17 14:25:49,528 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2025-03-17 14:25:49,528 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 490 flow [2025-03-17 14:25:49,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-17 14:25:49,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:49,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:49,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:25:49,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:49,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1867490994, now seen corresponding path program 2 times [2025-03-17 14:25:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516788580] [2025-03-17 14:25:49,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:49,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:25:49,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:25:49,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:25:49,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:49,658 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-17 14:25:49,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:49,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516788580] [2025-03-17 14:25:49,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516788580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:49,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:49,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:25:49,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617748031] [2025-03-17 14:25:49,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:49,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:25:49,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:49,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:25:49,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:25:49,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:49,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-17 14:25:49,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:49,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:49,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:49,796 INFO L124 PetriNetUnfolderBase]: 448/876 cut-off events. [2025-03-17 14:25:49,797 INFO L125 PetriNetUnfolderBase]: For 2962/2962 co-relation queries the response was YES. [2025-03-17 14:25:49,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3269 conditions, 876 events. 448/876 cut-off events. For 2962/2962 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4530 event pairs, 41 based on Foata normal form. 21/827 useless extension candidates. Maximal degree in co-relation 1341. Up to 287 conditions per place. [2025-03-17 14:25:49,802 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 74 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2025-03-17 14:25:49,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 93 transitions, 919 flow [2025-03-17 14:25:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-17 14:25:49,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2025-03-17 14:25:49,804 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 490 flow. Second operand 5 states and 108 transitions. [2025-03-17 14:25:49,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 93 transitions, 919 flow [2025-03-17 14:25:49,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 906 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:49,809 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 560 flow [2025-03-17 14:25:49,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=560, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-03-17 14:25:49,810 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2025-03-17 14:25:49,810 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 560 flow [2025-03-17 14:25:49,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-17 14:25:49,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:49,810 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:49,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:25:49,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:49,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:49,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1424386052, now seen corresponding path program 3 times [2025-03-17 14:25:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:49,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991420726] [2025-03-17 14:25:49,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:25:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:49,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-17 14:25:49,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 28 statements. [2025-03-17 14:25:49,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:25:49,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:49,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:49,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991420726] [2025-03-17 14:25:49,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991420726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:49,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729100825] [2025-03-17 14:25:49,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:25:49,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:49,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:49,920 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-17 14:25:49,922 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-17 14:25:49,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-17 14:25:50,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 28 statements. [2025-03-17 14:25:50,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:25:50,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:50,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:25:50,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:50,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729100825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:50,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:25:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209945189] [2025-03-17 14:25:50,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:50,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:25:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:50,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:25:50,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:25:50,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:50,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 560 flow. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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-17 14:25:50,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:50,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:50,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:50,813 INFO L124 PetriNetUnfolderBase]: 704/1384 cut-off events. [2025-03-17 14:25:50,813 INFO L125 PetriNetUnfolderBase]: For 4942/4942 co-relation queries the response was YES. [2025-03-17 14:25:50,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 1384 events. 704/1384 cut-off events. For 4942/4942 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7535 event pairs, 49 based on Foata normal form. 18/1296 useless extension candidates. Maximal degree in co-relation 2189. Up to 398 conditions per place. [2025-03-17 14:25:50,821 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 98 selfloop transitions, 25 changer transitions 0/132 dead transitions. [2025-03-17 14:25:50,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 132 transitions, 1299 flow [2025-03-17 14:25:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:25:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:25:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2025-03-17 14:25:50,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970588235294118 [2025-03-17 14:25:50,824 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 560 flow. Second operand 10 states and 203 transitions. [2025-03-17 14:25:50,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 132 transitions, 1299 flow [2025-03-17 14:25:50,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 132 transitions, 1294 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:50,833 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 821 flow [2025-03-17 14:25:50,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=821, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2025-03-17 14:25:50,835 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places. [2025-03-17 14:25:50,835 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 821 flow [2025-03-17 14:25:50,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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-17 14:25:50,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:50,836 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:50,843 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-17 14:25:51,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:51,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:51,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash -207728537, now seen corresponding path program 4 times [2025-03-17 14:25:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:51,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472762817] [2025-03-17 14:25:51,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:25:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:51,046 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-17 14:25:51,054 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:51,054 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:25:51,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:51,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472762817] [2025-03-17 14:25:51,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472762817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:51,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:51,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:25:51,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543144711] [2025-03-17 14:25:51,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:51,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:51,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:51,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:51,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:51,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:51,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 821 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:51,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:51,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:51,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:51,373 INFO L124 PetriNetUnfolderBase]: 923/1894 cut-off events. [2025-03-17 14:25:51,373 INFO L125 PetriNetUnfolderBase]: For 10224/10349 co-relation queries the response was YES. [2025-03-17 14:25:51,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7738 conditions, 1894 events. 923/1894 cut-off events. For 10224/10349 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11631 event pairs, 142 based on Foata normal form. 19/1742 useless extension candidates. Maximal degree in co-relation 7395. Up to 690 conditions per place. [2025-03-17 14:25:51,383 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 75 selfloop transitions, 34 changer transitions 0/132 dead transitions. [2025-03-17 14:25:51,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 132 transitions, 1652 flow [2025-03-17 14:25:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:25:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:25:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-17 14:25:51,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6691176470588235 [2025-03-17 14:25:51,384 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 821 flow. Second operand 4 states and 91 transitions. [2025-03-17 14:25:51,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 132 transitions, 1652 flow [2025-03-17 14:25:51,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 132 transitions, 1621 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-17 14:25:51,398 INFO L231 Difference]: Finished difference. Result has 83 places, 94 transitions, 1198 flow [2025-03-17 14:25:51,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1198, PETRI_PLACES=83, PETRI_TRANSITIONS=94} [2025-03-17 14:25:51,398 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2025-03-17 14:25:51,398 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 94 transitions, 1198 flow [2025-03-17 14:25:51,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:51,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:51,399 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:51,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:25:51,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:51,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:51,399 INFO L85 PathProgramCache]: Analyzing trace with hash 143074798, now seen corresponding path program 1 times [2025-03-17 14:25:51,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:51,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501466737] [2025-03-17 14:25:51,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:51,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:51,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:25:51,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:51,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:51,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:51,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:51,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501466737] [2025-03-17 14:25:51,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501466737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:51,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:51,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:25:51,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181097316] [2025-03-17 14:25:51,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:51,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:51,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:51,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:51,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:51,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 94 transitions, 1198 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-17 14:25:51,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:51,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:51,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:51,887 INFO L124 PetriNetUnfolderBase]: 1988/3930 cut-off events. [2025-03-17 14:25:51,888 INFO L125 PetriNetUnfolderBase]: For 36186/36428 co-relation queries the response was YES. [2025-03-17 14:25:51,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19001 conditions, 3930 events. 1988/3930 cut-off events. For 36186/36428 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 29580 event pairs, 675 based on Foata normal form. 46/3728 useless extension candidates. Maximal degree in co-relation 17959. Up to 1247 conditions per place. [2025-03-17 14:25:51,913 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 153 selfloop transitions, 19 changer transitions 0/197 dead transitions. [2025-03-17 14:25:51,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 197 transitions, 3143 flow [2025-03-17 14:25:51,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:25:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:25:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-17 14:25:51,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6838235294117647 [2025-03-17 14:25:51,915 INFO L175 Difference]: Start difference. First operand has 83 places, 94 transitions, 1198 flow. Second operand 4 states and 93 transitions. [2025-03-17 14:25:51,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 197 transitions, 3143 flow [2025-03-17 14:25:51,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 197 transitions, 3126 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:51,950 INFO L231 Difference]: Finished difference. Result has 88 places, 111 transitions, 1488 flow [2025-03-17 14:25:51,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1488, PETRI_PLACES=88, PETRI_TRANSITIONS=111} [2025-03-17 14:25:51,952 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2025-03-17 14:25:51,952 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 111 transitions, 1488 flow [2025-03-17 14:25:51,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-17 14:25:51,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:51,952 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:51,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:25:51,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:51,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -599780760, now seen corresponding path program 1 times [2025-03-17 14:25:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:51,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632072134] [2025-03-17 14:25:51,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:51,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:25:51,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:51,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:51,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:52,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:52,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632072134] [2025-03-17 14:25:52,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632072134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:52,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266669704] [2025-03-17 14:25:52,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:52,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:52,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:52,156 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-17 14:25:52,158 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-17 14:25:52,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:25:52,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:52,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:52,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:52,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:25:52,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:52,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:52,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266669704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:52,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:52,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-17 14:25:52,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356221898] [2025-03-17 14:25:52,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:52,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:25:52,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:52,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:25:52,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:25:52,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-03-17 14:25:52,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 111 transitions, 1488 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-17 14:25:52,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:52,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-03-17 14:25:52,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:53,113 INFO L124 PetriNetUnfolderBase]: 2698/5962 cut-off events. [2025-03-17 14:25:53,113 INFO L125 PetriNetUnfolderBase]: For 59214/59571 co-relation queries the response was YES. [2025-03-17 14:25:53,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30538 conditions, 5962 events. 2698/5962 cut-off events. For 59214/59571 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 49729 event pairs, 532 based on Foata normal form. 79/5881 useless extension candidates. Maximal degree in co-relation 28691. Up to 2340 conditions per place. [2025-03-17 14:25:53,146 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 217 selfloop transitions, 25 changer transitions 1/271 dead transitions. [2025-03-17 14:25:53,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 271 transitions, 4302 flow [2025-03-17 14:25:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:25:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:25:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-03-17 14:25:53,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7549019607843137 [2025-03-17 14:25:53,148 INFO L175 Difference]: Start difference. First operand has 88 places, 111 transitions, 1488 flow. Second operand 6 states and 154 transitions. [2025-03-17 14:25:53,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 271 transitions, 4302 flow [2025-03-17 14:25:53,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 271 transitions, 4302 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:25:53,205 INFO L231 Difference]: Finished difference. Result has 94 places, 127 transitions, 1627 flow [2025-03-17 14:25:53,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1627, PETRI_PLACES=94, PETRI_TRANSITIONS=127} [2025-03-17 14:25:53,206 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 60 predicate places. [2025-03-17 14:25:53,206 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 127 transitions, 1627 flow [2025-03-17 14:25:53,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-17 14:25:53,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:53,206 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:53,213 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-17 14:25:53,407 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,SelfDestructingSolverStorable10 [2025-03-17 14:25:53,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:53,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1225007896, now seen corresponding path program 1 times [2025-03-17 14:25:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:53,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273300384] [2025-03-17 14:25:53,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:53,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:53,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:25:53,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:53,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:53,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:53,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:53,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273300384] [2025-03-17 14:25:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273300384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:53,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:53,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:25:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029565236] [2025-03-17 14:25:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:53,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:53,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:53,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:53,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:53,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 127 transitions, 1627 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-17 14:25:53,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:53,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:53,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:53,992 INFO L124 PetriNetUnfolderBase]: 2527/5073 cut-off events. [2025-03-17 14:25:53,993 INFO L125 PetriNetUnfolderBase]: For 55182/55546 co-relation queries the response was YES. [2025-03-17 14:25:54,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27383 conditions, 5073 events. 2527/5073 cut-off events. For 55182/55546 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 38709 event pairs, 484 based on Foata normal form. 148/5076 useless extension candidates. Maximal degree in co-relation 26081. Up to 1945 conditions per place. [2025-03-17 14:25:54,030 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 146 selfloop transitions, 19 changer transitions 0/190 dead transitions. [2025-03-17 14:25:54,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 190 transitions, 2897 flow [2025-03-17 14:25:54,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:25:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:25:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-17 14:25:54,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6544117647058824 [2025-03-17 14:25:54,032 INFO L175 Difference]: Start difference. First operand has 94 places, 127 transitions, 1627 flow. Second operand 4 states and 89 transitions. [2025-03-17 14:25:54,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 190 transitions, 2897 flow [2025-03-17 14:25:54,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 190 transitions, 2847 flow, removed 25 selfloop flow, removed 0 redundant places. [2025-03-17 14:25:54,081 INFO L231 Difference]: Finished difference. Result has 99 places, 119 transitions, 1567 flow [2025-03-17 14:25:54,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1567, PETRI_PLACES=99, PETRI_TRANSITIONS=119} [2025-03-17 14:25:54,082 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2025-03-17 14:25:54,083 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 119 transitions, 1567 flow [2025-03-17 14:25:54,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-17 14:25:54,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:54,083 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:54,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:25:54,083 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1254563484, now seen corresponding path program 2 times [2025-03-17 14:25:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009872819] [2025-03-17 14:25:54,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:54,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 14:25:54,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:54,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:25:54,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009872819] [2025-03-17 14:25:54,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009872819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446980833] [2025-03-17 14:25:54,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:54,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:54,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:54,263 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-17 14:25:54,265 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-17 14:25:54,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 14:25:54,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:54,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:25:54,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:54,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:25:54,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:54,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:54,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446980833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:54,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-17 14:25:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389699165] [2025-03-17 14:25:54,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:54,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:25:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:54,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:25:54,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:25:54,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-03-17 14:25:54,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 119 transitions, 1567 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-17 14:25:54,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:54,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-03-17 14:25:54,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:55,159 INFO L124 PetriNetUnfolderBase]: 2679/6057 cut-off events. [2025-03-17 14:25:55,159 INFO L125 PetriNetUnfolderBase]: For 71426/71814 co-relation queries the response was YES. [2025-03-17 14:25:55,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33159 conditions, 6057 events. 2679/6057 cut-off events. For 71426/71814 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 51388 event pairs, 538 based on Foata normal form. 104/5983 useless extension candidates. Maximal degree in co-relation 31509. Up to 2495 conditions per place. [2025-03-17 14:25:55,194 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 226 selfloop transitions, 29 changer transitions 1/285 dead transitions. [2025-03-17 14:25:55,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 285 transitions, 4591 flow [2025-03-17 14:25:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:25:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:25:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2025-03-17 14:25:55,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-17 14:25:55,196 INFO L175 Difference]: Start difference. First operand has 99 places, 119 transitions, 1567 flow. Second operand 6 states and 153 transitions. [2025-03-17 14:25:55,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 285 transitions, 4591 flow [2025-03-17 14:25:55,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 285 transitions, 4591 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:25:55,260 INFO L231 Difference]: Finished difference. Result has 106 places, 138 transitions, 1758 flow [2025-03-17 14:25:55,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1758, PETRI_PLACES=106, PETRI_TRANSITIONS=138} [2025-03-17 14:25:55,261 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2025-03-17 14:25:55,261 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 138 transitions, 1758 flow [2025-03-17 14:25:55,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-17 14:25:55,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:55,261 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:55,269 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-17 14:25:55,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:55,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:55,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:55,464 INFO L85 PathProgramCache]: Analyzing trace with hash 231849778, now seen corresponding path program 3 times [2025-03-17 14:25:55,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:55,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441859657] [2025-03-17 14:25:55,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:25:55,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:55,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-03-17 14:25:55,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:55,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:25:55,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441859657] [2025-03-17 14:25:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441859657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544791789] [2025-03-17 14:25:55,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:25:55,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:55,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:55,659 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-17 14:25:55,661 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-17 14:25:55,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-03-17 14:25:55,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:55,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:25:55,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:55,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:25:55,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:55,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:55,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544791789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:55,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:55,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-17 14:25:55,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160050915] [2025-03-17 14:25:55,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:55,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:25:55,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:55,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:25:55,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:25:55,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-03-17 14:25:55,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 138 transitions, 1758 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-17 14:25:55,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:55,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-03-17 14:25:55,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:56,583 INFO L124 PetriNetUnfolderBase]: 3513/8029 cut-off events. [2025-03-17 14:25:56,584 INFO L125 PetriNetUnfolderBase]: For 98664/99206 co-relation queries the response was YES. [2025-03-17 14:25:56,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45901 conditions, 8029 events. 3513/8029 cut-off events. For 98664/99206 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 72476 event pairs, 647 based on Foata normal form. 160/7988 useless extension candidates. Maximal degree in co-relation 43498. Up to 3010 conditions per place. [2025-03-17 14:25:56,682 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 234 selfloop transitions, 44 changer transitions 1/308 dead transitions. [2025-03-17 14:25:56,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 308 transitions, 4906 flow [2025-03-17 14:25:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:25:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:25:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2025-03-17 14:25:56,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-17 14:25:56,683 INFO L175 Difference]: Start difference. First operand has 106 places, 138 transitions, 1758 flow. Second operand 6 states and 153 transitions. [2025-03-17 14:25:56,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 308 transitions, 4906 flow [2025-03-17 14:25:56,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 308 transitions, 4884 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-03-17 14:25:56,782 INFO L231 Difference]: Finished difference. Result has 115 places, 161 transitions, 2091 flow [2025-03-17 14:25:56,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2091, PETRI_PLACES=115, PETRI_TRANSITIONS=161} [2025-03-17 14:25:56,784 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 81 predicate places. [2025-03-17 14:25:56,784 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 161 transitions, 2091 flow [2025-03-17 14:25:56,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-17 14:25:56,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:56,785 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:56,790 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-17 14:25:56,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:56,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:56,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1444855542, now seen corresponding path program 4 times [2025-03-17 14:25:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:56,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949947079] [2025-03-17 14:25:56,986 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:25:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:56,992 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-17 14:25:57,003 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:57,003 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:25:57,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:57,135 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-17 14:25:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:57,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949947079] [2025-03-17 14:25:57,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949947079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:57,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397082717] [2025-03-17 14:25:57,135 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:25:57,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:57,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:57,137 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-17 14:25:57,139 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-17 14:25:57,172 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-17 14:25:57,187 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:25:57,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:25:57,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:57,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:25:57,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:57,254 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-17 14:25:57,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:57,322 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-17 14:25:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397082717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:57,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-17 14:25:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810779249] [2025-03-17 14:25:57,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:57,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:25:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:57,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:25:57,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:25:57,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-03-17 14:25:57,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 161 transitions, 2091 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-17 14:25:57,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:57,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-03-17 14:25:57,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:58,483 INFO L124 PetriNetUnfolderBase]: 3764/8681 cut-off events. [2025-03-17 14:25:58,484 INFO L125 PetriNetUnfolderBase]: For 112142/112855 co-relation queries the response was YES. [2025-03-17 14:25:58,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51569 conditions, 8681 events. 3764/8681 cut-off events. For 112142/112855 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 79783 event pairs, 755 based on Foata normal form. 209/8668 useless extension candidates. Maximal degree in co-relation 48853. Up to 4398 conditions per place. [2025-03-17 14:25:58,534 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 246 selfloop transitions, 33 changer transitions 1/309 dead transitions. [2025-03-17 14:25:58,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 309 transitions, 4955 flow [2025-03-17 14:25:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:25:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:25:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2025-03-17 14:25:58,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7401960784313726 [2025-03-17 14:25:58,536 INFO L175 Difference]: Start difference. First operand has 115 places, 161 transitions, 2091 flow. Second operand 6 states and 151 transitions. [2025-03-17 14:25:58,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 309 transitions, 4955 flow [2025-03-17 14:25:58,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 309 transitions, 4943 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-17 14:25:58,643 INFO L231 Difference]: Finished difference. Result has 123 places, 176 transitions, 2341 flow [2025-03-17 14:25:58,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2341, PETRI_PLACES=123, PETRI_TRANSITIONS=176} [2025-03-17 14:25:58,644 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 89 predicate places. [2025-03-17 14:25:58,644 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 176 transitions, 2341 flow [2025-03-17 14:25:58,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-17 14:25:58,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:58,644 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:58,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:58,844 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,SelfDestructingSolverStorable14 [2025-03-17 14:25:58,845 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:25:58,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1678589730, now seen corresponding path program 5 times [2025-03-17 14:25:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:58,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299299306] [2025-03-17 14:25:58,845 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:25:58,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:58,854 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-03-17 14:25:58,868 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:25:58,868 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:25:58,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299299306] [2025-03-17 14:25:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299299306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768970888] [2025-03-17 14:25:59,002 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:25:59,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:59,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:59,004 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-17 14:25:59,005 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-17 14:25:59,033 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-03-17 14:25:59,071 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:25:59,072 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:25:59,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:59,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:25:59,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:59,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768970888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:59,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-03-17 14:25:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176015205] [2025-03-17 14:25:59,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:59,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 14:25:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:59,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 14:25:59,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:25:59,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:25:59,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 176 transitions, 2341 flow. Second operand has 19 states, 19 states have (on average 15.68421052631579) internal successors, (298), 19 states have internal predecessors, (298), 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-17 14:25:59,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:59,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:25:59,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:02,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 14:26:10,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 14:26:15,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 14:26:19,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 14:26:24,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 14:26:41,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 14:26:43,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 14:26:48,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 14:27:17,843 INFO L124 PetriNetUnfolderBase]: 21703/44498 cut-off events. [2025-03-17 14:27:17,843 INFO L125 PetriNetUnfolderBase]: For 564397/564397 co-relation queries the response was YES. [2025-03-17 14:27:18,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269766 conditions, 44498 events. 21703/44498 cut-off events. For 564397/564397 co-relation queries the response was YES. Maximal size of possible extension queue 1588. Compared 455310 event pairs, 510 based on Foata normal form. 2190/46686 useless extension candidates. Maximal degree in co-relation 259912. Up to 8069 conditions per place. [2025-03-17 14:27:18,245 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 1612 selfloop transitions, 388 changer transitions 1/2014 dead transitions. [2025-03-17 14:27:18,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 2014 transitions, 27083 flow [2025-03-17 14:27:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-17 14:27:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-03-17 14:27:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 1231 transitions. [2025-03-17 14:27:18,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5935390549662488 [2025-03-17 14:27:18,249 INFO L175 Difference]: Start difference. First operand has 123 places, 176 transitions, 2341 flow. Second operand 61 states and 1231 transitions. [2025-03-17 14:27:18,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 2014 transitions, 27083 flow [2025-03-17 14:27:19,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 2014 transitions, 26558 flow, removed 236 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:19,500 INFO L231 Difference]: Finished difference. Result has 205 places, 556 transitions, 10221 flow [2025-03-17 14:27:19,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2307, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=10221, PETRI_PLACES=205, PETRI_TRANSITIONS=556} [2025-03-17 14:27:19,501 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 171 predicate places. [2025-03-17 14:27:19,501 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 556 transitions, 10221 flow [2025-03-17 14:27:19,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.68421052631579) internal successors, (298), 19 states have internal predecessors, (298), 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-17 14:27:19,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:19,501 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:19,507 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-17 14:27:19,702 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,SelfDestructingSolverStorable15 [2025-03-17 14:27:19,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 14:27:19,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2037585876, now seen corresponding path program 6 times [2025-03-17 14:27:19,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:19,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680338867] [2025-03-17 14:27:19,703 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:27:19,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:19,710 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:27:19,736 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:27:19,737 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 14:27:19,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:20,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680338867] [2025-03-17 14:27:20,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680338867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:20,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064971982] [2025-03-17 14:27:20,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:27:20,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:20,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:20,037 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-17 14:27:20,038 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-17 14:27:20,069 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:27:20,105 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:27:20,105 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 14:27:20,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:20,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:27:20,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:20,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:20,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064971982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:20,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:20,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-03-17 14:27:20,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814257873] [2025-03-17 14:27:20,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:20,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 14:27:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:20,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 14:27:20,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-17 14:27:20,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:27:20,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 556 transitions, 10221 flow. Second operand has 21 states, 21 states have (on average 15.428571428571429) internal successors, (324), 21 states have internal predecessors, (324), 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-17 14:27:20,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:20,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:27:20,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:25,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []