./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe021_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe021_tso.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 09edf41151ee2be1e615b82a5ff75107fc67a0fb206ce4e8ba7b647488d110c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:51:25,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:51:25,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:51:25,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:51:25,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:51:25,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:51:25,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:51:25,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:51:25,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:51:25,198 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:51:25,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:51:25,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:51:25,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:51:25,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:51:25,198 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:51:25,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:51:25,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:51:25,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:25,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:25,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:51:25,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:51:25,200 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-jdk21/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 -> 09edf41151ee2be1e615b82a5ff75107fc67a0fb206ce4e8ba7b647488d110c1 [2025-01-10 00:51:25,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:51:25,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:51:25,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:51:25,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:51:25,380 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:51:25,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe021_tso.i [2025-01-10 00:51:26,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cef42c47a/844fbd462acf4c309a3dc464c9304ac1/FLAG7b045512a [2025-01-10 00:51:26,953 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:51:26,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe021_tso.i [2025-01-10 00:51:26,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cef42c47a/844fbd462acf4c309a3dc464c9304ac1/FLAG7b045512a [2025-01-10 00:51:26,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cef42c47a/844fbd462acf4c309a3dc464c9304ac1 [2025-01-10 00:51:27,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:51:27,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:51:27,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:51:27,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:51:27,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:51:27,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ea0041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27, skipping insertion in model container [2025-01-10 00:51:27,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:51:27,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:51:27,419 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:51:27,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:51:27,469 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:51:27,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27 WrapperNode [2025-01-10 00:51:27,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:51:27,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:51:27,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:51:27,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:51:27,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,496 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2025-01-10 00:51:27,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:51:27,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:51:27,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:51:27,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:51:27,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,527 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-01-10 00:51:27,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:51:27,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:51:27,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:51:27,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:51:27,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (1/1) ... [2025-01-10 00:51:27,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:27,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:27,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:51:27,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:51:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:51:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:51:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:51:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:51:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:51:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:51:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:51:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:51:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:51:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:51:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:51:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:51:27,590 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:51:27,681 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:51:27,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:51:27,822 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:51:27,823 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:51:27,893 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:51:27,895 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:51:27,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:27 BoogieIcfgContainer [2025-01-10 00:51:27,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:51:27,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:51:27,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:51:27,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:51:27,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:51:27" (1/3) ... [2025-01-10 00:51:27,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab77dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:27, skipping insertion in model container [2025-01-10 00:51:27,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:27" (2/3) ... [2025-01-10 00:51:27,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab77dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:27, skipping insertion in model container [2025-01-10 00:51:27,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:27" (3/3) ... [2025-01-10 00:51:27,906 INFO L128 eAbstractionObserver]: Analyzing ICFG safe021_tso.i [2025-01-10 00:51:27,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:51:27,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe021_tso.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 00:51:27,921 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:51:27,971 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:51:27,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2025-01-10 00:51:28,033 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-01-10 00:51:28,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:28,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-01-10 00:51:28,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2025-01-10 00:51:28,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 39 transitions, 87 flow [2025-01-10 00:51:28,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:51:28,059 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;@6196fe64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:51:28,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 00:51:28,073 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:51:28,075 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-01-10 00:51:28,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:28,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:28,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:28,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash 710438097, now seen corresponding path program 1 times [2025-01-10 00:51:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:28,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290088852] [2025-01-10 00:51:28,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:28,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:51:28,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:51:28,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:28,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:28,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:28,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290088852] [2025-01-10 00:51:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290088852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:28,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742041420] [2025-01-10 00:51:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:28,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:28,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:28,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:28,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 43 [2025-01-10 00:51:28,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 00:51:28,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:28,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 43 [2025-01-10 00:51:28,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:28,437 INFO L124 PetriNetUnfolderBase]: 75/219 cut-off events. [2025-01-10 00:51:28,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:28,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 219 events. 75/219 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1153 event pairs, 75 based on Foata normal form. 24/225 useless extension candidates. Maximal degree in co-relation 363. Up to 136 conditions per place. [2025-01-10 00:51:28,440 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 12 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-01-10 00:51:28,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 35 transitions, 107 flow [2025-01-10 00:51:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-10 00:51:28,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2025-01-10 00:51:28,465 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 87 flow. Second operand 3 states and 89 transitions. [2025-01-10 00:51:28,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 35 transitions, 107 flow [2025-01-10 00:51:28,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:51:28,475 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-01-10 00:51:28,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-01-10 00:51:28,483 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2025-01-10 00:51:28,486 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-01-10 00:51:28,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 00:51:28,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:28,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:28,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:51:28,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:28,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 710439650, now seen corresponding path program 1 times [2025-01-10 00:51:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876976885] [2025-01-10 00:51:28,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:28,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:51:28,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:51:28,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:28,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:28,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:28,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876976885] [2025-01-10 00:51:28,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876976885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:28,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:28,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:51:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090601659] [2025-01-10 00:51:28,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:28,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:51:28,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:28,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:51:28,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:51:28,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2025-01-10 00:51:28,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-01-10 00:51:28,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:28,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2025-01-10 00:51:28,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:29,104 INFO L124 PetriNetUnfolderBase]: 1052/2030 cut-off events. [2025-01-10 00:51:29,105 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:29,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 2030 events. 1052/2030 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14741 event pairs, 211 based on Foata normal form. 0/1935 useless extension candidates. Maximal degree in co-relation 3715. Up to 644 conditions per place. [2025-01-10 00:51:29,114 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 26 selfloop transitions, 5 changer transitions 48/94 dead transitions. [2025-01-10 00:51:29,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 356 flow [2025-01-10 00:51:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:51:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:51:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 252 transitions. [2025-01-10 00:51:29,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-01-10 00:51:29,119 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 9 states and 252 transitions. [2025-01-10 00:51:29,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 356 flow [2025-01-10 00:51:29,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:51:29,121 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 143 flow [2025-01-10 00:51:29,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=143, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2025-01-10 00:51:29,122 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2025-01-10 00:51:29,122 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 143 flow [2025-01-10 00:51:29,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-01-10 00:51:29,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:29,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:29,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:51:29,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:29,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2062927041, now seen corresponding path program 1 times [2025-01-10 00:51:29,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:29,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446315126] [2025-01-10 00:51:29,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:29,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:29,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:51:29,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:51:29,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:29,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:29,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446315126] [2025-01-10 00:51:29,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446315126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:29,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:51:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348238214] [2025-01-10 00:51:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:51:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:29,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:51:29,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:51:29,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2025-01-10 00:51:29,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:29,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:29,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2025-01-10 00:51:29,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:29,509 INFO L124 PetriNetUnfolderBase]: 684/1437 cut-off events. [2025-01-10 00:51:29,509 INFO L125 PetriNetUnfolderBase]: For 1554/1554 co-relation queries the response was YES. [2025-01-10 00:51:29,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3919 conditions, 1437 events. 684/1437 cut-off events. For 1554/1554 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10161 event pairs, 126 based on Foata normal form. 40/1462 useless extension candidates. Maximal degree in co-relation 3904. Up to 517 conditions per place. [2025-01-10 00:51:29,517 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 29 selfloop transitions, 6 changer transitions 32/82 dead transitions. [2025-01-10 00:51:29,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 461 flow [2025-01-10 00:51:29,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:51:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:51:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2025-01-10 00:51:29,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5953488372093023 [2025-01-10 00:51:29,520 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 143 flow. Second operand 10 states and 256 transitions. [2025-01-10 00:51:29,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 461 flow [2025-01-10 00:51:29,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 395 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-01-10 00:51:29,532 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 173 flow [2025-01-10 00:51:29,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=173, PETRI_PLACES=65, PETRI_TRANSITIONS=39} [2025-01-10 00:51:29,533 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2025-01-10 00:51:29,533 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 173 flow [2025-01-10 00:51:29,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:29,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:29,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:29,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:51:29,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:29,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash -655789445, now seen corresponding path program 1 times [2025-01-10 00:51:29,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:29,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-01-10 00:51:29,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:29,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:51:29,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:51:29,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:29,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-01-10 00:51:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093798595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:29,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:29,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:51:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579207220] [2025-01-10 00:51:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:29,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:51:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:29,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:51:29,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:51:29,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2025-01-10 00:51:29,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 39 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:29,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:29,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2025-01-10 00:51:29,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:29,896 INFO L124 PetriNetUnfolderBase]: 637/1340 cut-off events. [2025-01-10 00:51:29,896 INFO L125 PetriNetUnfolderBase]: For 2659/2661 co-relation queries the response was YES. [2025-01-10 00:51:29,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3949 conditions, 1340 events. 637/1340 cut-off events. For 2659/2661 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8952 event pairs, 156 based on Foata normal form. 43/1367 useless extension candidates. Maximal degree in co-relation 3927. Up to 518 conditions per place. [2025-01-10 00:51:29,907 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 34 selfloop transitions, 11 changer transitions 34/94 dead transitions. [2025-01-10 00:51:29,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 94 transitions, 615 flow [2025-01-10 00:51:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:51:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:51:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 268 transitions. [2025-01-10 00:51:29,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6232558139534884 [2025-01-10 00:51:29,909 INFO L175 Difference]: Start difference. First operand has 65 places, 39 transitions, 173 flow. Second operand 10 states and 268 transitions. [2025-01-10 00:51:29,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 94 transitions, 615 flow [2025-01-10 00:51:29,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 563 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-01-10 00:51:29,944 INFO L231 Difference]: Finished difference. Result has 69 places, 43 transitions, 238 flow [2025-01-10 00:51:29,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=238, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2025-01-10 00:51:29,945 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2025-01-10 00:51:29,945 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 238 flow [2025-01-10 00:51:29,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:29,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:29,946 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-01-10 00:51:29,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:51:29,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:29,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 691510508, now seen corresponding path program 1 times [2025-01-10 00:51:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106743586] [2025-01-10 00:51:29,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:29,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:51:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:51:29,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:29,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:30,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:30,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106743586] [2025-01-10 00:51:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106743586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:30,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:30,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:51:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284000996] [2025-01-10 00:51:30,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:30,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:51:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:30,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:51:30,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:51:30,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-01-10 00:51:30,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 43 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:30,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:30,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-01-10 00:51:30,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:30,461 INFO L124 PetriNetUnfolderBase]: 965/1972 cut-off events. [2025-01-10 00:51:30,462 INFO L125 PetriNetUnfolderBase]: For 4984/4991 co-relation queries the response was YES. [2025-01-10 00:51:30,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6082 conditions, 1972 events. 965/1972 cut-off events. For 4984/4991 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14156 event pairs, 95 based on Foata normal form. 57/2015 useless extension candidates. Maximal degree in co-relation 6057. Up to 443 conditions per place. [2025-01-10 00:51:30,479 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 50 selfloop transitions, 19 changer transitions 54/137 dead transitions. [2025-01-10 00:51:30,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 137 transitions, 1089 flow [2025-01-10 00:51:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:51:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:51:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 344 transitions. [2025-01-10 00:51:30,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-01-10 00:51:30,483 INFO L175 Difference]: Start difference. First operand has 69 places, 43 transitions, 238 flow. Second operand 13 states and 344 transitions. [2025-01-10 00:51:30,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 137 transitions, 1089 flow [2025-01-10 00:51:30,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 137 transitions, 983 flow, removed 53 selfloop flow, removed 8 redundant places. [2025-01-10 00:51:30,498 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 460 flow [2025-01-10 00:51:30,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=460, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2025-01-10 00:51:30,500 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2025-01-10 00:51:30,501 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 460 flow [2025-01-10 00:51:30,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:30,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:30,502 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-01-10 00:51:30,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:51:30,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash -466866366, now seen corresponding path program 2 times [2025-01-10 00:51:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:30,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332504703] [2025-01-10 00:51:30,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:51:30,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:30,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:51:30,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:51:30,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:51:30,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:30,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:30,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332504703] [2025-01-10 00:51:30,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332504703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:30,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:30,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:51:30,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754077288] [2025-01-10 00:51:30,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:30,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:51:30,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:30,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:51:30,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:51:30,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-01-10 00:51:30,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 55 transitions, 460 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-01-10 00:51:30,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:30,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-01-10 00:51:30,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:30,954 INFO L124 PetriNetUnfolderBase]: 966/1987 cut-off events. [2025-01-10 00:51:30,955 INFO L125 PetriNetUnfolderBase]: For 10153/10184 co-relation queries the response was YES. [2025-01-10 00:51:30,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7406 conditions, 1987 events. 966/1987 cut-off events. For 10153/10184 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14485 event pairs, 194 based on Foata normal form. 58/2041 useless extension candidates. Maximal degree in co-relation 7375. Up to 444 conditions per place. [2025-01-10 00:51:30,972 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 35 selfloop transitions, 7 changer transitions 54/110 dead transitions. [2025-01-10 00:51:30,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 110 transitions, 1127 flow [2025-01-10 00:51:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:51:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:51:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2025-01-10 00:51:30,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020671834625323 [2025-01-10 00:51:30,975 INFO L175 Difference]: Start difference. First operand has 79 places, 55 transitions, 460 flow. Second operand 9 states and 233 transitions. [2025-01-10 00:51:30,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 110 transitions, 1127 flow [2025-01-10 00:51:30,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 110 transitions, 997 flow, removed 65 selfloop flow, removed 6 redundant places. [2025-01-10 00:51:30,995 INFO L231 Difference]: Finished difference. Result has 79 places, 40 transitions, 257 flow [2025-01-10 00:51:30,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=79, PETRI_TRANSITIONS=40} [2025-01-10 00:51:30,997 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2025-01-10 00:51:30,998 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 40 transitions, 257 flow [2025-01-10 00:51:30,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-01-10 00:51:30,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:30,998 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-01-10 00:51:30,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:51:30,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:30,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash 813330526, now seen corresponding path program 1 times [2025-01-10 00:51:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:30,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408375262] [2025-01-10 00:51:30,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:31,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:51:31,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:51:31,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:31,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:31,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:31,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408375262] [2025-01-10 00:51:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408375262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:31,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:31,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:51:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451410336] [2025-01-10 00:51:31,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:31,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:51:31,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:31,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:51:31,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:51:31,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-01-10 00:51:31,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 40 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:31,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:31,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-01-10 00:51:31,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:31,267 INFO L124 PetriNetUnfolderBase]: 851/1671 cut-off events. [2025-01-10 00:51:31,267 INFO L125 PetriNetUnfolderBase]: For 2239/2318 co-relation queries the response was YES. [2025-01-10 00:51:31,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4107 conditions, 1671 events. 851/1671 cut-off events. For 2239/2318 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10949 event pairs, 198 based on Foata normal form. 67/1645 useless extension candidates. Maximal degree in co-relation 4083. Up to 783 conditions per place. [2025-01-10 00:51:31,277 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 27 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-01-10 00:51:31,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 55 transitions, 355 flow [2025-01-10 00:51:31,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:51:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:51:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-01-10 00:51:31,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.686046511627907 [2025-01-10 00:51:31,279 INFO L175 Difference]: Start difference. First operand has 79 places, 40 transitions, 257 flow. Second operand 4 states and 118 transitions. [2025-01-10 00:51:31,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 55 transitions, 355 flow [2025-01-10 00:51:31,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 260 flow, removed 15 selfloop flow, removed 18 redundant places. [2025-01-10 00:51:31,284 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 200 flow [2025-01-10 00:51:31,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2025-01-10 00:51:31,285 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2025-01-10 00:51:31,285 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 200 flow [2025-01-10 00:51:31,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:31,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:31,285 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-01-10 00:51:31,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:51:31,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:31,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1514334109, now seen corresponding path program 1 times [2025-01-10 00:51:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:31,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333744119] [2025-01-10 00:51:31,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:31,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:31,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:51:31,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:51:31,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:31,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:31,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333744119] [2025-01-10 00:51:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333744119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:31,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:31,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:51:31,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94914996] [2025-01-10 00:51:31,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:31,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:51:31,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:31,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:51:31,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:51:31,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-01-10 00:51:31,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-01-10 00:51:31,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:31,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-01-10 00:51:31,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:31,472 INFO L124 PetriNetUnfolderBase]: 694/1368 cut-off events. [2025-01-10 00:51:31,473 INFO L125 PetriNetUnfolderBase]: For 629/1005 co-relation queries the response was YES. [2025-01-10 00:51:31,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3457 conditions, 1368 events. 694/1368 cut-off events. For 629/1005 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8234 event pairs, 69 based on Foata normal form. 79/1378 useless extension candidates. Maximal degree in co-relation 3444. Up to 544 conditions per place. [2025-01-10 00:51:31,478 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 34 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2025-01-10 00:51:31,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 347 flow [2025-01-10 00:51:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:51:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:51:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2025-01-10 00:51:31,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6930232558139535 [2025-01-10 00:51:31,480 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 200 flow. Second operand 5 states and 149 transitions. [2025-01-10 00:51:31,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 347 flow [2025-01-10 00:51:31,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:51:31,482 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 252 flow [2025-01-10 00:51:31,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2025-01-10 00:51:31,482 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-01-10 00:51:31,483 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 252 flow [2025-01-10 00:51:31,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-01-10 00:51:31,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:31,483 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] [2025-01-10 00:51:31,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:51:31,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:31,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash -872338758, now seen corresponding path program 1 times [2025-01-10 00:51:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:31,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434616884] [2025-01-10 00:51:31,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:31,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:51:31,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:51:31,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:31,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:31,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:31,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434616884] [2025-01-10 00:51:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434616884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:31,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:31,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:51:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220577627] [2025-01-10 00:51:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:31,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:51:31,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:31,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:51:31,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:51:31,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-01-10 00:51:31,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-01-10 00:51:31,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:31,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-01-10 00:51:31,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:31,722 INFO L124 PetriNetUnfolderBase]: 526/1000 cut-off events. [2025-01-10 00:51:31,722 INFO L125 PetriNetUnfolderBase]: For 1589/2375 co-relation queries the response was YES. [2025-01-10 00:51:31,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 1000 events. 526/1000 cut-off events. For 1589/2375 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5463 event pairs, 25 based on Foata normal form. 74/1017 useless extension candidates. Maximal degree in co-relation 3092. Up to 400 conditions per place. [2025-01-10 00:51:31,727 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 33 selfloop transitions, 11 changer transitions 0/67 dead transitions. [2025-01-10 00:51:31,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 389 flow [2025-01-10 00:51:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:51:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:51:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2025-01-10 00:51:31,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 00:51:31,728 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 252 flow. Second operand 6 states and 172 transitions. [2025-01-10 00:51:31,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 389 flow [2025-01-10 00:51:31,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 363 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 00:51:31,731 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 271 flow [2025-01-10 00:51:31,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-01-10 00:51:31,732 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2025-01-10 00:51:31,732 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 271 flow [2025-01-10 00:51:31,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-01-10 00:51:31,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:31,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:31,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:51:31,732 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:51:31,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash -862644968, now seen corresponding path program 1 times [2025-01-10 00:51:31,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:31,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151292787] [2025-01-10 00:51:31,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:31,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:31,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:51:31,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:31,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:31,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:31,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151292787] [2025-01-10 00:51:31,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151292787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:31,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:31,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:51:31,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570909768] [2025-01-10 00:51:31,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:31,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:51:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:31,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:51:31,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:51:31,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-01-10 00:51:31,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-01-10 00:51:31,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:31,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-01-10 00:51:31,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:32,018 INFO L124 PetriNetUnfolderBase]: 502/1077 cut-off events. [2025-01-10 00:51:32,019 INFO L125 PetriNetUnfolderBase]: For 2017/2131 co-relation queries the response was YES. [2025-01-10 00:51:32,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3248 conditions, 1077 events. 502/1077 cut-off events. For 2017/2131 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6743 event pairs, 143 based on Foata normal form. 16/956 useless extension candidates. Maximal degree in co-relation 3234. Up to 472 conditions per place. [2025-01-10 00:51:32,023 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 0 selfloop transitions, 0 changer transitions 73/73 dead transitions. [2025-01-10 00:51:32,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 73 transitions, 447 flow [2025-01-10 00:51:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:51:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:51:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-01-10 00:51:32,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5780730897009967 [2025-01-10 00:51:32,025 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 271 flow. Second operand 7 states and 174 transitions. [2025-01-10 00:51:32,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 73 transitions, 447 flow [2025-01-10 00:51:32,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 423 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 00:51:32,029 INFO L231 Difference]: Finished difference. Result has 69 places, 0 transitions, 0 flow [2025-01-10 00:51:32,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=69, PETRI_TRANSITIONS=0} [2025-01-10 00:51:32,030 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2025-01-10 00:51:32,030 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 0 transitions, 0 flow [2025-01-10 00:51:32,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-01-10 00:51:32,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-01-10 00:51:32,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 00:51:32,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-10 00:51:32,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-10 00:51:32,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-10 00:51:32,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:51:32,036 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:32,039 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:51:32,039 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:51:32,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:51:32 BasicIcfg [2025-01-10 00:51:32,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:51:32,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:51:32,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:51:32,044 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:51:32,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:27" (3/4) ... [2025-01-10 00:51:32,046 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:51:32,048 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2025-01-10 00:51:32,048 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2025-01-10 00:51:32,048 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2025-01-10 00:51:32,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-01-10 00:51:32,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 00:51:32,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 00:51:32,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 00:51:32,111 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:51:32,112 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:51:32,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:51:32,113 INFO L158 Benchmark]: Toolchain (without parser) took 5106.95ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 127.3MB in the beginning and 344.6MB in the end (delta: -217.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2025-01-10 00:51:32,113 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:32,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.03ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 108.0MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:51:32,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.78ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:51:32,114 INFO L158 Benchmark]: Boogie Preprocessor took 39.57ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 104.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:32,115 INFO L158 Benchmark]: RCFGBuilder took 358.55ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 85.3MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:51:32,116 INFO L158 Benchmark]: TraceAbstraction took 4145.03ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 84.5MB in the beginning and 348.8MB in the end (delta: -264.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:32,116 INFO L158 Benchmark]: Witness Printer took 68.03ms. Allocated memory is still 419.4MB. Free memory was 348.8MB in the beginning and 344.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:32,118 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.21ms. Allocated memory is still 226.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.03ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 108.0MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.78ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.57ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 104.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 358.55ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 85.3MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4145.03ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 84.5MB in the beginning and 348.8MB in the end (delta: -264.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 68.03ms. Allocated memory is still 419.4MB. Free memory was 348.8MB in the beginning and 344.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 776]: 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, 66 locations, 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: 4.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 882 IncrementalHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 70 mSDtfsCounter, 882 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=5, InterpolantAutomatonStates: 76, 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.2s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-01-10 00:51:32,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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