./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c --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/weaver/parallel-bakery-2.wvr.c -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 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:04:14,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:04:14,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:04:14,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:04:14,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:04:14,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:04:14,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:04:14,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:04:14,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:04:14,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:04:14,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:04:14,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:04:14,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:04:14,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:04:14,602 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:04:14,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:04:14,603 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:04:14,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:04:14,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:04:14,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:04:14,603 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:04:14,604 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:04:14,604 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:04:14,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:04:14,604 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:04:14,604 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:04:14,604 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:04:14,604 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:04:14,604 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:04:14,604 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:04:14,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:04:14,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:04:14,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:04:14,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:04:14,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:04:14,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:04:14,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:04:14,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:04:14,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:04:14,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:04:14,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:04:14,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:04:14,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:04:14,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:04:14,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:04:14,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:04:14,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:04:14,607 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 -> 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b [2025-01-10 01:04:14,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:04:14,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:04:14,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:04:14,892 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:04:14,892 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:04:14,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-01-10 01:04:16,181 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4eeecd7d/3711e701fbf34a04894115613c65fedd/FLAG9a1748a9a [2025-01-10 01:04:16,422 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:04:16,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-01-10 01:04:16,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4eeecd7d/3711e701fbf34a04894115613c65fedd/FLAG9a1748a9a [2025-01-10 01:04:16,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4eeecd7d/3711e701fbf34a04894115613c65fedd [2025-01-10 01:04:16,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:04:16,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:04:16,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:04:16,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:04:16,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:04:16,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:16,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aee790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16, skipping insertion in model container [2025-01-10 01:04:16,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:16,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:04:16,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:04:16,926 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:04:16,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:04:16,953 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:04:16,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16 WrapperNode [2025-01-10 01:04:16,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:04:16,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:04:16,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:04:16,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:04:16,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:16,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:16,982 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 141 [2025-01-10 01:04:16,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:04:16,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:04:16,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:04:16,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:04:16,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:16,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:16,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:17,007 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 01:04:17,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:17,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:17,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:17,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:17,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:17,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:17,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:17,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:04:17,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:04:17,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:04:17,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:04:17,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (1/1) ... [2025-01-10 01:04:17,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:04:17,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:17,044 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 01:04:17,047 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 01:04:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:04:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:04:17,063 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:04:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:04:17,063 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:04:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:04:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:04:17,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:04:17,064 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 01:04:17,124 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:04:17,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:04:17,383 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:04:17,383 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:04:17,523 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:04:17,524 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:04:17,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:04:17 BoogieIcfgContainer [2025-01-10 01:04:17,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:04:17,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:04:17,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:04:17,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:04:17,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:04:16" (1/3) ... [2025-01-10 01:04:17,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae6b1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:04:17, skipping insertion in model container [2025-01-10 01:04:17,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:16" (2/3) ... [2025-01-10 01:04:17,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae6b1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:04:17, skipping insertion in model container [2025-01-10 01:04:17,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:04:17" (3/3) ... [2025-01-10 01:04:17,537 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2025-01-10 01:04:17,548 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:04:17,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-2.wvr.c that has 3 procedures, 55 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 01:04:17,550 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:04:17,614 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:04:17,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 126 flow [2025-01-10 01:04:17,692 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2025-01-10 01:04:17,695 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:04:17,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 54 events. 2/54 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-01-10 01:04:17,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 56 transitions, 126 flow [2025-01-10 01:04:17,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 53 transitions, 118 flow [2025-01-10 01:04:17,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:04:17,732 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;@3281329e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:04:17,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:04:17,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:04:17,749 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-01-10 01:04:17,749 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:04:17,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:17,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:17,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:17,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash 532631702, now seen corresponding path program 1 times [2025-01-10 01:04:17,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:17,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104168413] [2025-01-10 01:04:17,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:17,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:04:17,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:04:17,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:17,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:18,399 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 01:04:18,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:18,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104168413] [2025-01-10 01:04:18,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104168413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:18,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:04:18,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581041113] [2025-01-10 01:04:18,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:18,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:04:18,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:18,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:04:18,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:04:18,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2025-01-10 01:04:18,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 118 flow. Second operand has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 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 01:04:18,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:18,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2025-01-10 01:04:18,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:18,838 INFO L124 PetriNetUnfolderBase]: 168/427 cut-off events. [2025-01-10 01:04:18,839 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 01:04:18,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 427 events. 168/427 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1942 event pairs, 56 based on Foata normal form. 4/407 useless extension candidates. Maximal degree in co-relation 684. Up to 98 conditions per place. [2025-01-10 01:04:18,844 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 51 selfloop transitions, 10 changer transitions 12/94 dead transitions. [2025-01-10 01:04:18,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 373 flow [2025-01-10 01:04:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:04:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:04:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 269 transitions. [2025-01-10 01:04:18,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6004464285714286 [2025-01-10 01:04:18,861 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 118 flow. Second operand 8 states and 269 transitions. [2025-01-10 01:04:18,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 373 flow [2025-01-10 01:04:18,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 347 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:04:18,876 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 150 flow [2025-01-10 01:04:18,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-01-10 01:04:18,882 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-01-10 01:04:18,883 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 150 flow [2025-01-10 01:04:18,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 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 01:04:18,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:18,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:18,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:04:18,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:18,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1887306448, now seen corresponding path program 2 times [2025-01-10 01:04:18,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:18,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419904513] [2025-01-10 01:04:18,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:04:18,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:18,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:04:18,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:04:18,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:04:18,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:19,108 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 01:04:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419904513] [2025-01-10 01:04:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419904513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:19,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:19,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624910694] [2025-01-10 01:04:19,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:19,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:19,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:19,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:19,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:19,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:04:19,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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 01:04:19,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:19,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:04:19,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:19,377 INFO L124 PetriNetUnfolderBase]: 330/757 cut-off events. [2025-01-10 01:04:19,378 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 01:04:19,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 757 events. 330/757 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3878 event pairs, 46 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 1469. Up to 418 conditions per place. [2025-01-10 01:04:19,383 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 50 selfloop transitions, 18 changer transitions 6/98 dead transitions. [2025-01-10 01:04:19,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 385 flow [2025-01-10 01:04:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:04:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:04:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2025-01-10 01:04:19,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5867346938775511 [2025-01-10 01:04:19,386 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 150 flow. Second operand 7 states and 230 transitions. [2025-01-10 01:04:19,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 385 flow [2025-01-10 01:04:19,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 383 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:19,394 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 261 flow [2025-01-10 01:04:19,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2025-01-10 01:04:19,396 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2025-01-10 01:04:19,396 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 261 flow [2025-01-10 01:04:19,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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 01:04:19,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:19,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:19,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:04:19,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:19,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2089213480, now seen corresponding path program 3 times [2025-01-10 01:04:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:19,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379148733] [2025-01-10 01:04:19,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:04:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:19,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:04:19,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:04:19,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:04:19,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379148733] [2025-01-10 01:04:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379148733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:19,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622642711] [2025-01-10 01:04:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:19,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:04:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:19,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:04:19,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:04:19,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2025-01-10 01:04:19,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 01:04:19,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:19,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2025-01-10 01:04:19,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:19,641 INFO L124 PetriNetUnfolderBase]: 209/577 cut-off events. [2025-01-10 01:04:19,641 INFO L125 PetriNetUnfolderBase]: For 234/237 co-relation queries the response was YES. [2025-01-10 01:04:19,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 577 events. 209/577 cut-off events. For 234/237 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3044 event pairs, 101 based on Foata normal form. 8/553 useless extension candidates. Maximal degree in co-relation 833. Up to 250 conditions per place. [2025-01-10 01:04:19,648 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 33 selfloop transitions, 2 changer transitions 1/76 dead transitions. [2025-01-10 01:04:19,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 354 flow [2025-01-10 01:04:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:04:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:04:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-01-10 01:04:19,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2025-01-10 01:04:19,649 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 261 flow. Second operand 3 states and 116 transitions. [2025-01-10 01:04:19,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 354 flow [2025-01-10 01:04:19,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 349 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:19,657 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 264 flow [2025-01-10 01:04:19,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-01-10 01:04:19,659 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-01-10 01:04:19,659 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 264 flow [2025-01-10 01:04:19,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 01:04:19,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:19,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:04:19,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1262023420, now seen corresponding path program 4 times [2025-01-10 01:04:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779800184] [2025-01-10 01:04:19,661 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:04:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:19,673 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-01-10 01:04:19,690 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:04:19,690 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:04:19,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:19,901 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 01:04:19,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779800184] [2025-01-10 01:04:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779800184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:19,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:19,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:19,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981269185] [2025-01-10 01:04:19,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:19,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:19,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:19,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:19,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-01-10 01:04:19,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:19,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:19,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-01-10 01:04:19,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:20,127 INFO L124 PetriNetUnfolderBase]: 286/734 cut-off events. [2025-01-10 01:04:20,128 INFO L125 PetriNetUnfolderBase]: For 477/493 co-relation queries the response was YES. [2025-01-10 01:04:20,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 734 events. 286/734 cut-off events. For 477/493 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3927 event pairs, 61 based on Foata normal form. 6/702 useless extension candidates. Maximal degree in co-relation 909. Up to 391 conditions per place. [2025-01-10 01:04:20,133 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 41 selfloop transitions, 14 changer transitions 4/90 dead transitions. [2025-01-10 01:04:20,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 90 transitions, 442 flow [2025-01-10 01:04:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-01-10 01:04:20,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464285714285715 [2025-01-10 01:04:20,138 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 264 flow. Second operand 5 states and 181 transitions. [2025-01-10 01:04:20,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 90 transitions, 442 flow [2025-01-10 01:04:20,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:20,145 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 326 flow [2025-01-10 01:04:20,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2025-01-10 01:04:20,147 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2025-01-10 01:04:20,147 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 326 flow [2025-01-10 01:04:20,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:20,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:20,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:20,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:04:20,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:20,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:20,149 INFO L85 PathProgramCache]: Analyzing trace with hash -241809294, now seen corresponding path program 5 times [2025-01-10 01:04:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276608788] [2025-01-10 01:04:20,150 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:04:20,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:20,162 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:04:20,170 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:04:20,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:04:20,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:20,283 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 01:04:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276608788] [2025-01-10 01:04:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276608788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:20,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:20,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:04:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109534289] [2025-01-10 01:04:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:20,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:04:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:20,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:04:20,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:04:20,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2025-01-10 01:04:20,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 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 01:04:20,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:20,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2025-01-10 01:04:20,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:20,581 INFO L124 PetriNetUnfolderBase]: 316/741 cut-off events. [2025-01-10 01:04:20,582 INFO L125 PetriNetUnfolderBase]: For 849/864 co-relation queries the response was YES. [2025-01-10 01:04:20,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 741 events. 316/741 cut-off events. For 849/864 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3872 event pairs, 93 based on Foata normal form. 3/702 useless extension candidates. Maximal degree in co-relation 954. Up to 202 conditions per place. [2025-01-10 01:04:20,587 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 48 selfloop transitions, 11 changer transitions 13/105 dead transitions. [2025-01-10 01:04:20,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 105 transitions, 584 flow [2025-01-10 01:04:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:04:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:04:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2025-01-10 01:04:20,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5758928571428571 [2025-01-10 01:04:20,590 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 326 flow. Second operand 8 states and 258 transitions. [2025-01-10 01:04:20,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 105 transitions, 584 flow [2025-01-10 01:04:20,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 105 transitions, 570 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:20,598 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 339 flow [2025-01-10 01:04:20,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=339, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2025-01-10 01:04:20,600 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2025-01-10 01:04:20,601 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 339 flow [2025-01-10 01:04:20,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 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 01:04:20,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:20,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:20,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:04:20,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:20,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash 83534048, now seen corresponding path program 6 times [2025-01-10 01:04:20,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:20,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265572957] [2025-01-10 01:04:20,606 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:04:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:20,618 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:04:20,632 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:04:20,632 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:04:20,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:20,691 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 01:04:20,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:20,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265572957] [2025-01-10 01:04:20,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265572957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:20,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:20,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:20,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29551164] [2025-01-10 01:04:20,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:20,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:04:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:20,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:04:20,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:04:20,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2025-01-10 01:04:20,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 01:04:20,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:20,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2025-01-10 01:04:20,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:20,829 INFO L124 PetriNetUnfolderBase]: 227/673 cut-off events. [2025-01-10 01:04:20,834 INFO L125 PetriNetUnfolderBase]: For 509/534 co-relation queries the response was YES. [2025-01-10 01:04:20,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 673 events. 227/673 cut-off events. For 509/534 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3814 event pairs, 115 based on Foata normal form. 12/639 useless extension candidates. Maximal degree in co-relation 1690. Up to 271 conditions per place. [2025-01-10 01:04:20,839 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 34 selfloop transitions, 2 changer transitions 1/78 dead transitions. [2025-01-10 01:04:20,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 78 transitions, 433 flow [2025-01-10 01:04:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:04:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:04:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-01-10 01:04:20,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-01-10 01:04:20,841 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 339 flow. Second operand 3 states and 117 transitions. [2025-01-10 01:04:20,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 78 transitions, 433 flow [2025-01-10 01:04:20,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 414 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 01:04:20,845 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 328 flow [2025-01-10 01:04:20,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2025-01-10 01:04:20,846 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2025-01-10 01:04:20,846 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 328 flow [2025-01-10 01:04:20,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 01:04:20,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:20,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:20,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:04:20,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -647813982, now seen corresponding path program 7 times [2025-01-10 01:04:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038487654] [2025-01-10 01:04:20,847 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:04:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:20,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:04:20,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:04:20,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:20,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:20,931 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 01:04:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:20,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038487654] [2025-01-10 01:04:20,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038487654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:20,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:20,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007627061] [2025-01-10 01:04:20,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:20,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:20,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:20,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:20,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:20,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:04:20,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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 01:04:20,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:20,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:04:20,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:21,179 INFO L124 PetriNetUnfolderBase]: 326/813 cut-off events. [2025-01-10 01:04:21,179 INFO L125 PetriNetUnfolderBase]: For 804/868 co-relation queries the response was YES. [2025-01-10 01:04:21,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2231 conditions, 813 events. 326/813 cut-off events. For 804/868 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4330 event pairs, 60 based on Foata normal form. 18/781 useless extension candidates. Maximal degree in co-relation 1402. Up to 445 conditions per place. [2025-01-10 01:04:21,183 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 50 selfloop transitions, 20 changer transitions 5/102 dead transitions. [2025-01-10 01:04:21,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 102 transitions, 573 flow [2025-01-10 01:04:21,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:04:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:04:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2025-01-10 01:04:21,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5790816326530612 [2025-01-10 01:04:21,185 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 328 flow. Second operand 7 states and 227 transitions. [2025-01-10 01:04:21,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 102 transitions, 573 flow [2025-01-10 01:04:21,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 102 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:21,191 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 408 flow [2025-01-10 01:04:21,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2025-01-10 01:04:21,193 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2025-01-10 01:04:21,194 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 408 flow [2025-01-10 01:04:21,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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 01:04:21,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:21,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:21,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:04:21,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:21,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:21,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2038060070, now seen corresponding path program 8 times [2025-01-10 01:04:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:21,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325991079] [2025-01-10 01:04:21,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:04:21,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:21,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:04:21,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:04:21,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:04:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:21,363 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 01:04:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325991079] [2025-01-10 01:04:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325991079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:21,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551101718] [2025-01-10 01:04:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:21,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:21,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:21,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:21,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-01-10 01:04:21,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:21,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:21,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-01-10 01:04:21,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:21,552 INFO L124 PetriNetUnfolderBase]: 233/646 cut-off events. [2025-01-10 01:04:21,552 INFO L125 PetriNetUnfolderBase]: For 827/847 co-relation queries the response was YES. [2025-01-10 01:04:21,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 646 events. 233/646 cut-off events. For 827/847 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3457 event pairs, 54 based on Foata normal form. 6/620 useless extension candidates. Maximal degree in co-relation 1349. Up to 383 conditions per place. [2025-01-10 01:04:21,556 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 35 selfloop transitions, 12 changer transitions 4/85 dead transitions. [2025-01-10 01:04:21,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 517 flow [2025-01-10 01:04:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2025-01-10 01:04:21,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-01-10 01:04:21,558 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 408 flow. Second operand 5 states and 172 transitions. [2025-01-10 01:04:21,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 517 flow [2025-01-10 01:04:21,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 487 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 01:04:21,563 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 367 flow [2025-01-10 01:04:21,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2025-01-10 01:04:21,564 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2025-01-10 01:04:21,564 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 367 flow [2025-01-10 01:04:21,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:21,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:21,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:21,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:04:21,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:21,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1763093801, now seen corresponding path program 1 times [2025-01-10 01:04:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:21,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681738136] [2025-01-10 01:04:21,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:21,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:21,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:04:21,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:04:21,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:21,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:21,651 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 01:04:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681738136] [2025-01-10 01:04:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681738136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:21,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:21,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:04:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964719544] [2025-01-10 01:04:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:21,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:04:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:21,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:04:21,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:04:21,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:04:21,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 01:04:21,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:21,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:04:21,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:21,810 INFO L124 PetriNetUnfolderBase]: 245/638 cut-off events. [2025-01-10 01:04:21,810 INFO L125 PetriNetUnfolderBase]: For 826/850 co-relation queries the response was YES. [2025-01-10 01:04:21,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1862 conditions, 638 events. 245/638 cut-off events. For 826/850 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3180 event pairs, 54 based on Foata normal form. 10/628 useless extension candidates. Maximal degree in co-relation 1288. Up to 298 conditions per place. [2025-01-10 01:04:21,814 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 44 selfloop transitions, 13 changer transitions 1/84 dead transitions. [2025-01-10 01:04:21,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 84 transitions, 508 flow [2025-01-10 01:04:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-01-10 01:04:21,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-01-10 01:04:21,816 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 367 flow. Second operand 5 states and 165 transitions. [2025-01-10 01:04:21,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 84 transitions, 508 flow [2025-01-10 01:04:21,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 84 transitions, 464 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-01-10 01:04:21,820 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 355 flow [2025-01-10 01:04:21,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2025-01-10 01:04:21,821 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2025-01-10 01:04:21,821 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 355 flow [2025-01-10 01:04:21,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 01:04:21,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:21,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:21,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:04:21,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:21,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:21,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1223320663, now seen corresponding path program 2 times [2025-01-10 01:04:21,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:21,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561636298] [2025-01-10 01:04:21,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:04:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:21,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:04:21,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:04:21,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:04:21,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:21,977 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 01:04:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:21,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561636298] [2025-01-10 01:04:21,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561636298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:21,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:21,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:04:21,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910933303] [2025-01-10 01:04:21,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:21,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:04:21,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:21,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:04:21,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:04:22,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:04:22,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 355 flow. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 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 01:04:22,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:22,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:04:22,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:22,209 INFO L124 PetriNetUnfolderBase]: 257/666 cut-off events. [2025-01-10 01:04:22,209 INFO L125 PetriNetUnfolderBase]: For 1176/1200 co-relation queries the response was YES. [2025-01-10 01:04:22,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 666 events. 257/666 cut-off events. For 1176/1200 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3367 event pairs, 89 based on Foata normal form. 6/653 useless extension candidates. Maximal degree in co-relation 1458. Up to 266 conditions per place. [2025-01-10 01:04:22,212 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 41 selfloop transitions, 7 changer transitions 22/96 dead transitions. [2025-01-10 01:04:22,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 96 transitions, 617 flow [2025-01-10 01:04:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:04:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:04:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2025-01-10 01:04:22,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.548469387755102 [2025-01-10 01:04:22,215 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 355 flow. Second operand 7 states and 215 transitions. [2025-01-10 01:04:22,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 96 transitions, 617 flow [2025-01-10 01:04:22,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 611 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 01:04:22,221 INFO L231 Difference]: Finished difference. Result has 93 places, 66 transitions, 336 flow [2025-01-10 01:04:22,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=93, PETRI_TRANSITIONS=66} [2025-01-10 01:04:22,222 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 35 predicate places. [2025-01-10 01:04:22,222 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 66 transitions, 336 flow [2025-01-10 01:04:22,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 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 01:04:22,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:22,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:22,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:04:22,223 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:22,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1743571051, now seen corresponding path program 1 times [2025-01-10 01:04:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360294621] [2025-01-10 01:04:22,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:22,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:04:22,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:04:22,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:22,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:22,287 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 01:04:22,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360294621] [2025-01-10 01:04:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360294621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:22,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:22,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:04:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775888369] [2025-01-10 01:04:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:22,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:04:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:22,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:04:22,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:04:22,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:04:22,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 66 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 01:04:22,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:22,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:04:22,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:22,414 INFO L124 PetriNetUnfolderBase]: 132/366 cut-off events. [2025-01-10 01:04:22,415 INFO L125 PetriNetUnfolderBase]: For 747/771 co-relation queries the response was YES. [2025-01-10 01:04:22,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 366 events. 132/366 cut-off events. For 747/771 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1437 event pairs, 31 based on Foata normal form. 8/363 useless extension candidates. Maximal degree in co-relation 1121. Up to 194 conditions per place. [2025-01-10 01:04:22,417 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 30 selfloop transitions, 6 changer transitions 11/69 dead transitions. [2025-01-10 01:04:22,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 69 transitions, 408 flow [2025-01-10 01:04:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-01-10 01:04:22,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-01-10 01:04:22,418 INFO L175 Difference]: Start difference. First operand has 93 places, 66 transitions, 336 flow. Second operand 5 states and 156 transitions. [2025-01-10 01:04:22,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 69 transitions, 408 flow [2025-01-10 01:04:22,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 350 flow, removed 7 selfloop flow, removed 13 redundant places. [2025-01-10 01:04:22,421 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 214 flow [2025-01-10 01:04:22,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2025-01-10 01:04:22,422 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2025-01-10 01:04:22,422 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 214 flow [2025-01-10 01:04:22,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 01:04:22,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:22,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:22,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:04:22,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:04:22,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1024708387, now seen corresponding path program 2 times [2025-01-10 01:04:22,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:22,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467598974] [2025-01-10 01:04:22,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:04:22,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:22,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:04:22,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:04:22,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:04:22,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:22,529 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 01:04:22,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:22,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467598974] [2025-01-10 01:04:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467598974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:22,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:04:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941287486] [2025-01-10 01:04:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:04:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:22,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:04:22,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:04:22,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:04:22,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 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 01:04:22,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:22,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:04:22,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:22,665 INFO L124 PetriNetUnfolderBase]: 42/149 cut-off events. [2025-01-10 01:04:22,665 INFO L125 PetriNetUnfolderBase]: For 123/125 co-relation queries the response was YES. [2025-01-10 01:04:22,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 149 events. 42/149 cut-off events. For 123/125 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 404 event pairs, 17 based on Foata normal form. 8/155 useless extension candidates. Maximal degree in co-relation 392. Up to 59 conditions per place. [2025-01-10 01:04:22,665 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2025-01-10 01:04:22,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 49 transitions, 255 flow [2025-01-10 01:04:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:04:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:04:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2025-01-10 01:04:22,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2025-01-10 01:04:22,667 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 214 flow. Second operand 7 states and 188 transitions. [2025-01-10 01:04:22,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 49 transitions, 255 flow [2025-01-10 01:04:22,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 213 flow, removed 3 selfloop flow, removed 13 redundant places. [2025-01-10 01:04:22,668 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-01-10 01:04:22,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-01-10 01:04:22,670 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2025-01-10 01:04:22,671 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-01-10 01:04:22,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 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 01:04:22,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-01-10 01:04:22,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-01-10 01:04:22,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-10 01:04:22,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-10 01:04:22,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:04:22,675 INFO L422 BasicCegarLoop]: Path program histogram: [8, 2, 2] [2025-01-10 01:04:22,678 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:04:22,678 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:04:22,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:04:22 BasicIcfg [2025-01-10 01:04:22,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:04:22,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:04:22,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:04:22,683 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:04:22,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:04:17" (3/4) ... [2025-01-10 01:04:22,684 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:04:22,687 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 01:04:22,687 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 01:04:22,691 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2025-01-10 01:04:22,691 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-10 01:04:22,691 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:04:22,691 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:04:22,769 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:04:22,769 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:04:22,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:04:22,770 INFO L158 Benchmark]: Toolchain (without parser) took 6026.36ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.7MB in the beginning and 177.1MB in the end (delta: -64.4MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2025-01-10 01:04:22,771 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:04:22,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.23ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.2MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:04:22,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.65ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:04:22,774 INFO L158 Benchmark]: Boogie Preprocessor took 32.66ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:04:22,774 INFO L158 Benchmark]: RCFGBuilder took 506.38ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 71.2MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:04:22,774 INFO L158 Benchmark]: TraceAbstraction took 5154.84ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 70.7MB in the beginning and 183.7MB in the end (delta: -113.0MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2025-01-10 01:04:22,775 INFO L158 Benchmark]: Witness Printer took 86.89ms. Allocated memory is still 218.1MB. Free memory was 183.7MB in the beginning and 177.1MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:04:22,776 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.24ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.23ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.2MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.65ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.66ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 506.38ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 71.2MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5154.84ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 70.7MB in the beginning and 183.7MB in the end (delta: -113.0MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. * Witness Printer took 86.89ms. Allocated memory is still 218.1MB. Free memory was 183.7MB in the beginning and 177.1MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 77]: 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 5 procedures, 85 locations, 4 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: 5.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1770 IncrementalHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 52 mSDtfsCounter, 1770 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=7, InterpolantAutomatonStates: 70, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 1246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 01:04:22,797 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