./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e136f4ab00a1c93eb400bb9f2a21b2887cfec20e18dff1c5960bc25f16f1bcad --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:09:17,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:09:17,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:09:17,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:09:17,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:09:17,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:09:17,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:09:17,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:09:17,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:09:17,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:09:17,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:09:17,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:09:17,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:09:17,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:09:17,898 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:09:17,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:09:17,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:09:17,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:09:17,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:09:17,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:09:17,899 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:09:17,899 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:09:17,899 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:09:17,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:09:17,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:09:17,900 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:09:17,900 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:09:17,900 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:09:17,900 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:09:17,900 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:09:17,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:09:17,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:09:17,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:09:17,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:09:17,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:09:17,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:09:17,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:09:17,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:09:17,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:09:17,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:09:17,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:09:17,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:09:17,901 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 -> e136f4ab00a1c93eb400bb9f2a21b2887cfec20e18dff1c5960bc25f16f1bcad [2025-03-09 01:09:18,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:09:18,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:09:18,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:09:18,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:09:18,157 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:09:18,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-09 01:09:19,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a53408cf/d7a7d77e1a78434bb2ddb05c276c0c67/FLAGe616c433a [2025-03-09 01:09:19,640 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:09:19,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-09 01:09:19,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a53408cf/d7a7d77e1a78434bb2ddb05c276c0c67/FLAGe616c433a [2025-03-09 01:09:19,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a53408cf/d7a7d77e1a78434bb2ddb05c276c0c67 [2025-03-09 01:09:19,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:09:19,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:09:19,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:09:19,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:09:19,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:09:19,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:09:19" (1/1) ... [2025-03-09 01:09:19,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc4ab25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:19, skipping insertion in model container [2025-03-09 01:09:19,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:09:19" (1/1) ... [2025-03-09 01:09:19,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:09:20,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:09:20,264 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:09:20,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:09:20,341 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:09:20,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20 WrapperNode [2025-03-09 01:09:20,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:09:20,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:09:20,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:09:20,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:09:20,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,387 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2025-03-09 01:09:20,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:09:20,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:09:20,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:09:20,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:09:20,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,422 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:09:20,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:09:20,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:09:20,441 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:09:20,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:09:20,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (1/1) ... [2025-03-09 01:09:20,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:09:20,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:09:20,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:09:20,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:09:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:09:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:09:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 01:09:20,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 01:09:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 01:09:20,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 01:09:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-09 01:09:20,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-09 01:09:20,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:09:20,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:09:20,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:09:20,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:09:20,498 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:09:20,601 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:09:20,602 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:09:20,742 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:09:20,742 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:09:20,807 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:09:20,807 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:09:20,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:09:20 BoogieIcfgContainer [2025-03-09 01:09:20,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:09:20,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:09:20,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:09:20,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:09:20,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:09:19" (1/3) ... [2025-03-09 01:09:20,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153ee1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:09:20, skipping insertion in model container [2025-03-09 01:09:20,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:09:20" (2/3) ... [2025-03-09 01:09:20,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153ee1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:09:20, skipping insertion in model container [2025-03-09 01:09:20,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:09:20" (3/3) ... [2025-03-09 01:09:20,815 INFO L128 eAbstractionObserver]: Analyzing ICFG safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-09 01:09:20,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:09:20,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 01:09:20,828 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:09:20,866 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:09:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 96 flow [2025-03-09 01:09:20,930 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2025-03-09 01:09:20,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:09:20,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 2/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-03-09 01:09:20,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 42 transitions, 96 flow [2025-03-09 01:09:20,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 38 transitions, 85 flow [2025-03-09 01:09:20,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:09:20,967 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;@26dd295c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:09:20,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-09 01:09:20,976 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:09:20,976 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2025-03-09 01:09:20,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:09:20,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:20,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:09:20,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1572525387, now seen corresponding path program 1 times [2025-03-09 01:09:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:20,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336868835] [2025-03-09 01:09:20,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:20,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:21,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:09:21,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:09:21,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:21,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:21,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:21,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336868835] [2025-03-09 01:09:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336868835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:09:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693318817] [2025-03-09 01:09:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:21,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:09:21,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:21,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:09:21,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:09:21,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-09 01:09:21,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:21,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:21,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-09 01:09:21,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:21,821 INFO L124 PetriNetUnfolderBase]: 3925/6137 cut-off events. [2025-03-09 01:09:21,821 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 01:09:21,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11834 conditions, 6137 events. 3925/6137 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 35546 event pairs, 3925 based on Foata normal form. 540/6636 useless extension candidates. Maximal degree in co-relation 11823. Up to 5618 conditions per place. [2025-03-09 01:09:21,858 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 26 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2025-03-09 01:09:21,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 133 flow [2025-03-09 01:09:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:09:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:09:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-09 01:09:21,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2025-03-09 01:09:21,872 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 85 flow. Second operand 3 states and 58 transitions. [2025-03-09 01:09:21,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 133 flow [2025-03-09 01:09:21,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:09:21,879 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2025-03-09 01:09:21,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-03-09 01:09:21,886 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2025-03-09 01:09:21,887 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2025-03-09 01:09:21,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:21,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:21,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:09:21,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:09:21,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1572525817, now seen corresponding path program 1 times [2025-03-09 01:09:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199643628] [2025-03-09 01:09:21,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:21,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:09:21,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:09:21,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:21,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:22,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:22,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199643628] [2025-03-09 01:09:22,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199643628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:22,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:22,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:09:22,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738021472] [2025-03-09 01:09:22,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:22,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:09:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:22,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:09:22,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:09:22,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-09 01:09:22,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:22,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:22,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-09 01:09:22,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:22,951 INFO L124 PetriNetUnfolderBase]: 5026/7593 cut-off events. [2025-03-09 01:09:22,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:09:22,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14910 conditions, 7593 events. 5026/7593 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 43817 event pairs, 1419 based on Foata normal form. 0/7414 useless extension candidates. Maximal degree in co-relation 14904. Up to 4876 conditions per place. [2025-03-09 01:09:22,984 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 38 selfloop transitions, 3 changer transitions 60/106 dead transitions. [2025-03-09 01:09:22,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 106 transitions, 426 flow [2025-03-09 01:09:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:09:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:09:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2025-03-09 01:09:22,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-09 01:09:22,989 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 8 states and 175 transitions. [2025-03-09 01:09:22,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 106 transitions, 426 flow [2025-03-09 01:09:22,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 106 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:09:22,994 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 106 flow [2025-03-09 01:09:22,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=106, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-09 01:09:22,995 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2025-03-09 01:09:22,995 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 106 flow [2025-03-09 01:09:22,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:22,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:22,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:09:22,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:09:22,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:22,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1670105368, now seen corresponding path program 1 times [2025-03-09 01:09:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644902153] [2025-03-09 01:09:22,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:23,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:09:23,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:09:23,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:23,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:23,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:23,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644902153] [2025-03-09 01:09:23,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644902153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:23,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:23,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:09:23,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573495467] [2025-03-09 01:09:23,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:23,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:09:23,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:23,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:09:23,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:09:23,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-09 01:09:23,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:23,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:23,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-09 01:09:23,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:23,682 INFO L124 PetriNetUnfolderBase]: 3849/5881 cut-off events. [2025-03-09 01:09:23,682 INFO L125 PetriNetUnfolderBase]: For 2982/2982 co-relation queries the response was YES. [2025-03-09 01:09:23,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13861 conditions, 5881 events. 3849/5881 cut-off events. For 2982/2982 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 31918 event pairs, 684 based on Foata normal form. 150/6020 useless extension candidates. Maximal degree in co-relation 13849. Up to 4121 conditions per place. [2025-03-09 01:09:23,713 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 38 selfloop transitions, 3 changer transitions 45/91 dead transitions. [2025-03-09 01:09:23,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 91 transitions, 414 flow [2025-03-09 01:09:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:09:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:09:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2025-03-09 01:09:23,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-09 01:09:23,715 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 106 flow. Second operand 7 states and 150 transitions. [2025-03-09 01:09:23,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 91 transitions, 414 flow [2025-03-09 01:09:23,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 91 transitions, 397 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-09 01:09:23,742 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 116 flow [2025-03-09 01:09:23,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2025-03-09 01:09:23,743 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2025-03-09 01:09:23,743 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 116 flow [2025-03-09 01:09:23,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:23,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:23,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:09:23,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:09:23,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:23,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2140813028, now seen corresponding path program 1 times [2025-03-09 01:09:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:23,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275387896] [2025-03-09 01:09:23,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:23,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:23,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:09:23,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:09:23,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:23,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:23,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:23,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275387896] [2025-03-09 01:09:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275387896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:09:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394999246] [2025-03-09 01:09:23,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:23,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:09:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:23,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:09:23,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:09:23,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-09 01:09:23,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:23,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:23,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-09 01:09:23,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:24,663 INFO L124 PetriNetUnfolderBase]: 6017/8993 cut-off events. [2025-03-09 01:09:24,664 INFO L125 PetriNetUnfolderBase]: For 6378/6378 co-relation queries the response was YES. [2025-03-09 01:09:24,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21683 conditions, 8993 events. 6017/8993 cut-off events. For 6378/6378 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 51012 event pairs, 1053 based on Foata normal form. 275/9265 useless extension candidates. Maximal degree in co-relation 21667. Up to 4049 conditions per place. [2025-03-09 01:09:24,696 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 68 selfloop transitions, 11 changer transitions 96/180 dead transitions. [2025-03-09 01:09:24,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 180 transitions, 864 flow [2025-03-09 01:09:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:09:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:09:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 294 transitions. [2025-03-09 01:09:24,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-09 01:09:24,699 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 116 flow. Second operand 13 states and 294 transitions. [2025-03-09 01:09:24,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 180 transitions, 864 flow [2025-03-09 01:09:24,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 180 transitions, 818 flow, removed 18 selfloop flow, removed 6 redundant places. [2025-03-09 01:09:24,722 INFO L231 Difference]: Finished difference. Result has 68 places, 42 transitions, 212 flow [2025-03-09 01:09:24,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=212, PETRI_PLACES=68, PETRI_TRANSITIONS=42} [2025-03-09 01:09:24,723 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2025-03-09 01:09:24,723 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 42 transitions, 212 flow [2025-03-09 01:09:24,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:24,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:24,723 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-09 01:09:24,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:09:24,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:24,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -737073897, now seen corresponding path program 1 times [2025-03-09 01:09:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595187722] [2025-03-09 01:09:24,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:24,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:09:24,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:09:24,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:24,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:24,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595187722] [2025-03-09 01:09:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595187722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:24,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:24,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:09:24,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308424030] [2025-03-09 01:09:24,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:24,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:09:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:24,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:09:24,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:09:24,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-09 01:09:24,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 42 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-09 01:09:24,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:24,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-09 01:09:24,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:25,636 INFO L124 PetriNetUnfolderBase]: 5722/8353 cut-off events. [2025-03-09 01:09:25,636 INFO L125 PetriNetUnfolderBase]: For 22049/22052 co-relation queries the response was YES. [2025-03-09 01:09:25,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25494 conditions, 8353 events. 5722/8353 cut-off events. For 22049/22052 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 46056 event pairs, 304 based on Foata normal form. 125/8471 useless extension candidates. Maximal degree in co-relation 25471. Up to 5445 conditions per place. [2025-03-09 01:09:25,681 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 78 selfloop transitions, 12 changer transitions 71/166 dead transitions. [2025-03-09 01:09:25,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 166 transitions, 1081 flow [2025-03-09 01:09:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:09:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:09:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2025-03-09 01:09:25,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-03-09 01:09:25,683 INFO L175 Difference]: Start difference. First operand has 68 places, 42 transitions, 212 flow. Second operand 13 states and 266 transitions. [2025-03-09 01:09:25,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 166 transitions, 1081 flow [2025-03-09 01:09:25,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 166 transitions, 961 flow, removed 60 selfloop flow, removed 6 redundant places. [2025-03-09 01:09:25,712 INFO L231 Difference]: Finished difference. Result has 77 places, 49 transitions, 327 flow [2025-03-09 01:09:25,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=327, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2025-03-09 01:09:25,714 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2025-03-09 01:09:25,714 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 49 transitions, 327 flow [2025-03-09 01:09:25,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-09 01:09:25,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:25,715 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-09 01:09:25,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:09:25,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:25,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash 119584279, now seen corresponding path program 1 times [2025-03-09 01:09:25,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:25,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960125992] [2025-03-09 01:09:25,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:25,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:09:25,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:09:25,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:25,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960125992] [2025-03-09 01:09:25,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960125992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:25,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:25,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:09:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283782395] [2025-03-09 01:09:25,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:25,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:09:25,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:25,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:09:25,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:09:25,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-09 01:09:25,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 49 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-09 01:09:25,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:25,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-09 01:09:25,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:26,339 INFO L124 PetriNetUnfolderBase]: 4377/6591 cut-off events. [2025-03-09 01:09:26,340 INFO L125 PetriNetUnfolderBase]: For 27477/27477 co-relation queries the response was YES. [2025-03-09 01:09:26,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23149 conditions, 6591 events. 4377/6591 cut-off events. For 27477/27477 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 34981 event pairs, 2044 based on Foata normal form. 136/6723 useless extension candidates. Maximal degree in co-relation 23119. Up to 4910 conditions per place. [2025-03-09 01:09:26,376 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 51 selfloop transitions, 9 changer transitions 49/114 dead transitions. [2025-03-09 01:09:26,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 114 transitions, 872 flow [2025-03-09 01:09:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:09:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:09:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2025-03-09 01:09:26,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-09 01:09:26,378 INFO L175 Difference]: Start difference. First operand has 77 places, 49 transitions, 327 flow. Second operand 7 states and 150 transitions. [2025-03-09 01:09:26,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 114 transitions, 872 flow [2025-03-09 01:09:26,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 114 transitions, 770 flow, removed 46 selfloop flow, removed 9 redundant places. [2025-03-09 01:09:26,414 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 325 flow [2025-03-09 01:09:26,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-03-09 01:09:26,415 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2025-03-09 01:09:26,415 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 325 flow [2025-03-09 01:09:26,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-09 01:09:26,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:26,415 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-09 01:09:26,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:09:26,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:26,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 915196307, now seen corresponding path program 1 times [2025-03-09 01:09:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:26,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667155029] [2025-03-09 01:09:26,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:26,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:09:26,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:09:26,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:26,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667155029] [2025-03-09 01:09:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667155029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:26,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:26,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:09:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223462237] [2025-03-09 01:09:26,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:26,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:09:26,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:26,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:09:26,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:09:26,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-09 01:09:26,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:26,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:26,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-09 01:09:26,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:27,220 INFO L124 PetriNetUnfolderBase]: 5486/8130 cut-off events. [2025-03-09 01:09:27,220 INFO L125 PetriNetUnfolderBase]: For 17635/17635 co-relation queries the response was YES. [2025-03-09 01:09:27,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24999 conditions, 8130 events. 5486/8130 cut-off events. For 17635/17635 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 43939 event pairs, 966 based on Foata normal form. 120/8245 useless extension candidates. Maximal degree in co-relation 24971. Up to 3371 conditions per place. [2025-03-09 01:09:27,255 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 51 selfloop transitions, 6 changer transitions 66/128 dead transitions. [2025-03-09 01:09:27,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 128 transitions, 901 flow [2025-03-09 01:09:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:09:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:09:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2025-03-09 01:09:27,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2025-03-09 01:09:27,258 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 325 flow. Second operand 8 states and 177 transitions. [2025-03-09 01:09:27,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 128 transitions, 901 flow [2025-03-09 01:09:27,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 128 transitions, 843 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-09 01:09:27,319 INFO L231 Difference]: Finished difference. Result has 72 places, 41 transitions, 238 flow [2025-03-09 01:09:27,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=72, PETRI_TRANSITIONS=41} [2025-03-09 01:09:27,319 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2025-03-09 01:09:27,320 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 41 transitions, 238 flow [2025-03-09 01:09:27,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:27,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:27,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:09:27,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:09:27,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:27,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1307350056, now seen corresponding path program 1 times [2025-03-09 01:09:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:27,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381346202] [2025-03-09 01:09:27,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:27,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:09:27,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:09:27,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:27,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:27,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:27,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381346202] [2025-03-09 01:09:27,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381346202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:27,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:27,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:09:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635916813] [2025-03-09 01:09:27,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:27,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:09:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:27,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:09:27,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:09:27,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-09 01:09:27,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 41 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:27,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:27,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-09 01:09:27,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:27,902 INFO L124 PetriNetUnfolderBase]: 3851/5783 cut-off events. [2025-03-09 01:09:27,902 INFO L125 PetriNetUnfolderBase]: For 15476/15476 co-relation queries the response was YES. [2025-03-09 01:09:27,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17529 conditions, 5783 events. 3851/5783 cut-off events. For 15476/15476 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 29044 event pairs, 765 based on Foata normal form. 100/5876 useless extension candidates. Maximal degree in co-relation 17501. Up to 2113 conditions per place. [2025-03-09 01:09:27,921 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 41 selfloop transitions, 3 changer transitions 57/106 dead transitions. [2025-03-09 01:09:27,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 694 flow [2025-03-09 01:09:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:09:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:09:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-03-09 01:09:27,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2025-03-09 01:09:27,924 INFO L175 Difference]: Start difference. First operand has 72 places, 41 transitions, 238 flow. Second operand 8 states and 167 transitions. [2025-03-09 01:09:27,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 694 flow [2025-03-09 01:09:27,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 601 flow, removed 36 selfloop flow, removed 10 redundant places. [2025-03-09 01:09:27,947 INFO L231 Difference]: Finished difference. Result has 71 places, 32 transitions, 147 flow [2025-03-09 01:09:27,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=147, PETRI_PLACES=71, PETRI_TRANSITIONS=32} [2025-03-09 01:09:27,948 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2025-03-09 01:09:27,950 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 32 transitions, 147 flow [2025-03-09 01:09:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:27,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:27,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:09:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:09:27,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1738692013, now seen corresponding path program 1 times [2025-03-09 01:09:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327839681] [2025-03-09 01:09:27,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:27,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:09:27,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:09:27,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:27,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:28,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:28,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327839681] [2025-03-09 01:09:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327839681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:28,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:28,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:09:28,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777866819] [2025-03-09 01:09:28,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:28,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:09:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:28,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:09:28,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:09:28,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-03-09 01:09:28,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 32 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:28,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:28,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-03-09 01:09:28,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:28,185 INFO L124 PetriNetUnfolderBase]: 1527/2451 cut-off events. [2025-03-09 01:09:28,185 INFO L125 PetriNetUnfolderBase]: For 3928/3928 co-relation queries the response was YES. [2025-03-09 01:09:28,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6845 conditions, 2451 events. 1527/2451 cut-off events. For 3928/3928 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 12046 event pairs, 173 based on Foata normal form. 105/2554 useless extension candidates. Maximal degree in co-relation 6819. Up to 1447 conditions per place. [2025-03-09 01:09:28,195 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 48 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2025-03-09 01:09:28,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 379 flow [2025-03-09 01:09:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:09:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:09:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-09 01:09:28,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-09 01:09:28,197 INFO L175 Difference]: Start difference. First operand has 71 places, 32 transitions, 147 flow. Second operand 4 states and 96 transitions. [2025-03-09 01:09:28,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 379 flow [2025-03-09 01:09:28,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 279 flow, removed 21 selfloop flow, removed 19 redundant places. [2025-03-09 01:09:28,203 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 127 flow [2025-03-09 01:09:28,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2025-03-09 01:09:28,203 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2025-03-09 01:09:28,203 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 127 flow [2025-03-09 01:09:28,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:28,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:28,204 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-09 01:09:28,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:09:28,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:28,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash -395085890, now seen corresponding path program 1 times [2025-03-09 01:09:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:28,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303403733] [2025-03-09 01:09:28,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:28,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:09:28,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:09:28,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:28,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303403733] [2025-03-09 01:09:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303403733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:28,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:28,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:09:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980995794] [2025-03-09 01:09:28,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:28,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:09:28,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:28,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:09:28,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:09:28,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-03-09 01:09:28,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-09 01:09:28,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:28,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-03-09 01:09:28,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:28,618 INFO L124 PetriNetUnfolderBase]: 956/1567 cut-off events. [2025-03-09 01:09:28,619 INFO L125 PetriNetUnfolderBase]: For 868/868 co-relation queries the response was YES. [2025-03-09 01:09:28,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 1567 events. 956/1567 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6875 event pairs, 88 based on Foata normal form. 84/1649 useless extension candidates. Maximal degree in co-relation 4042. Up to 661 conditions per place. [2025-03-09 01:09:28,626 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 55 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2025-03-09 01:09:28,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 367 flow [2025-03-09 01:09:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:09:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:09:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-09 01:09:28,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-03-09 01:09:28,628 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 127 flow. Second operand 5 states and 116 transitions. [2025-03-09 01:09:28,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 367 flow [2025-03-09 01:09:28,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 357 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:09:28,630 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 167 flow [2025-03-09 01:09:28,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2025-03-09 01:09:28,632 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2025-03-09 01:09:28,633 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 167 flow [2025-03-09 01:09:28,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-09 01:09:28,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:28,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:09:28,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:09:28,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1940311021, now seen corresponding path program 1 times [2025-03-09 01:09:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604096485] [2025-03-09 01:09:28,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:28,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:09:28,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:09:28,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:28,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:28,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:28,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604096485] [2025-03-09 01:09:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604096485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:28,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:28,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:09:28,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644592349] [2025-03-09 01:09:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:28,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:09:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:28,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:09:28,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:09:28,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-03-09 01:09:28,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:28,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:28,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-03-09 01:09:28,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:28,882 INFO L124 PetriNetUnfolderBase]: 522/853 cut-off events. [2025-03-09 01:09:28,882 INFO L125 PetriNetUnfolderBase]: For 954/954 co-relation queries the response was YES. [2025-03-09 01:09:28,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 853 events. 522/853 cut-off events. For 954/954 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3075 event pairs, 70 based on Foata normal form. 40/891 useless extension candidates. Maximal degree in co-relation 2400. Up to 284 conditions per place. [2025-03-09 01:09:28,886 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 48 selfloop transitions, 11 changer transitions 1/65 dead transitions. [2025-03-09 01:09:28,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 366 flow [2025-03-09 01:09:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:09:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:09:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-03-09 01:09:28,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2025-03-09 01:09:28,888 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 167 flow. Second operand 6 states and 122 transitions. [2025-03-09 01:09:28,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 366 flow [2025-03-09 01:09:28,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 308 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-09 01:09:28,891 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 163 flow [2025-03-09 01:09:28,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2025-03-09 01:09:28,892 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2025-03-09 01:09:28,892 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 163 flow [2025-03-09 01:09:28,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:28,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:09:28,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:09:28,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:09:28,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:09:28,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:09:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 632616874, now seen corresponding path program 1 times [2025-03-09 01:09:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:09:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195379485] [2025-03-09 01:09:28,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:09:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:09:28,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:09:28,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:09:28,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:09:28,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:09:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:09:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:09:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195379485] [2025-03-09 01:09:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195379485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:09:28,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:09:28,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:09:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309652715] [2025-03-09 01:09:28,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:09:28,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:09:28,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:09:28,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:09:28,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:09:28,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-09 01:09:28,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:28,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:09:28,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-09 01:09:28,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:09:29,094 INFO L124 PetriNetUnfolderBase]: 442/708 cut-off events. [2025-03-09 01:09:29,095 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2025-03-09 01:09:29,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 708 events. 442/708 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2347 event pairs, 82 based on Foata normal form. 8/715 useless extension candidates. Maximal degree in co-relation 1911. Up to 444 conditions per place. [2025-03-09 01:09:29,097 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 0 selfloop transitions, 0 changer transitions 53/53 dead transitions. [2025-03-09 01:09:29,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 319 flow [2025-03-09 01:09:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:09:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:09:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-03-09 01:09:29,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38492063492063494 [2025-03-09 01:09:29,098 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 163 flow. Second operand 6 states and 97 transitions. [2025-03-09 01:09:29,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 319 flow [2025-03-09 01:09:29,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 247 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-03-09 01:09:29,099 INFO L231 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2025-03-09 01:09:29,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2025-03-09 01:09:29,100 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2025-03-09 01:09:29,100 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 0 transitions, 0 flow [2025-03-09 01:09:29,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:09:29,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-03-09 01:09:29,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-09 01:09:29,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-09 01:09:29,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-09 01:09:29,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-09 01:09:29,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:09:29,105 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:09:29,108 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:09:29,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:09:29,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:09:29 BasicIcfg [2025-03-09 01:09:29,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:09:29,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:09:29,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:09:29,113 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:09:29,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:09:20" (3/4) ... [2025-03-09 01:09:29,115 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:09:29,117 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-09 01:09:29,118 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-09 01:09:29,118 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-09 01:09:29,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-09 01:09:29,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 01:09:29,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 01:09:29,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:09:29,183 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:09:29,183 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:09:29,183 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:09:29,184 INFO L158 Benchmark]: Toolchain (without parser) took 9245.30ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 110.1MB in the beginning and 165.8MB in the end (delta: -55.8MB). Peak memory consumption was 282.5MB. Max. memory is 16.1GB. [2025-03-09 01:09:29,184 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:09:29,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.78ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 90.4MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:09:29,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.72ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 975.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:09:29,185 INFO L158 Benchmark]: Boogie Preprocessor took 47.38ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 86.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:09:29,185 INFO L158 Benchmark]: IcfgBuilder took 370.21ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 66.8MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:09:29,185 INFO L158 Benchmark]: TraceAbstraction took 8302.41ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 65.8MB in the beginning and 171.3MB in the end (delta: -105.4MB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. [2025-03-09 01:09:29,185 INFO L158 Benchmark]: Witness Printer took 71.19ms. Allocated memory is still 478.2MB. Free memory was 171.3MB in the beginning and 165.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:09:29,186 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.78ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 90.4MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.72ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 975.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.38ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 86.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 370.21ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 66.8MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8302.41ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 65.8MB in the beginning and 171.3MB in the end (delta: -105.4MB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. * Witness Printer took 71.19ms. Allocated memory is still 478.2MB. Free memory was 171.3MB in the beginning and 165.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 773]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 62 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 881 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 877 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1845 IncrementalHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 4 mSDtfsCounter, 1845 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=5, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:09:29,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE