./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix009.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix009.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4dcfd24df13a4fc35e028ca53c41591d13aa2fa957261180f0dd9c1764b57d13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:42:09,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:42:09,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:42:09,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:42:09,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:42:09,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:42:09,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:42:09,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:42:09,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:42:09,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:42:09,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:42:09,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:42:09,822 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:42:09,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:09,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:42:09,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:09,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:42:09,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:42:09,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:42:09,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:42:09,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:42:09,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:42:09,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:42:09,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:42:09,824 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 -> 4dcfd24df13a4fc35e028ca53c41591d13aa2fa957261180f0dd9c1764b57d13 [2025-01-10 00:42:10,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:42:10,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:42:10,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:42:10,071 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:42:10,071 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:42:10,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix009.oepc.i [2025-01-10 00:42:11,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef671be76/8695c2cf1422422388ba9371ff94f735/FLAG9148ce99d [2025-01-10 00:42:11,410 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:42:11,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix009.oepc.i [2025-01-10 00:42:11,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef671be76/8695c2cf1422422388ba9371ff94f735/FLAG9148ce99d [2025-01-10 00:42:11,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef671be76/8695c2cf1422422388ba9371ff94f735 [2025-01-10 00:42:11,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:42:11,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:42:11,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:42:11,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:42:11,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:42:11,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:42:11" (1/1) ... [2025-01-10 00:42:11,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9d69f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:11, skipping insertion in model container [2025-01-10 00:42:11,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:42:11" (1/1) ... [2025-01-10 00:42:11,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:42:12,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:42:12,081 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:42:12,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:42:12,149 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:42:12,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12 WrapperNode [2025-01-10 00:42:12,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:42:12,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:42:12,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:42:12,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:42:12,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,184 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 117 [2025-01-10 00:42:12,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:42:12,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:42:12,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:42:12,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:42:12,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:42:12,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:42:12,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:42:12,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:42:12,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:42:12,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (1/1) ... [2025-01-10 00:42:12,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:12,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:12,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:42:12,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:42:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:42:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:42:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:42:12,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:42:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:42:12,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:42:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:42:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:42:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:42:12,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:42:12,284 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:42:12,381 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:42:12,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:42:12,576 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:42:12,577 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:42:12,745 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:42:12,745 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:42:12,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:12 BoogieIcfgContainer [2025-01-10 00:42:12,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:42:12,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:42:12,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:42:12,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:42:12,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:42:11" (1/3) ... [2025-01-10 00:42:12,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d93627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:42:12, skipping insertion in model container [2025-01-10 00:42:12,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:12" (2/3) ... [2025-01-10 00:42:12,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d93627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:42:12, skipping insertion in model container [2025-01-10 00:42:12,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:12" (3/3) ... [2025-01-10 00:42:12,755 INFO L128 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2025-01-10 00:42:12,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:42:12,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix009.oepc.i that has 3 procedures, 37 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:42:12,771 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:42:12,817 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:42:12,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 84 flow [2025-01-10 00:42:12,873 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2025-01-10 00:42:12,876 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:12,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-10 00:42:12,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 84 flow [2025-01-10 00:42:12,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 78 flow [2025-01-10 00:42:12,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:42:12,898 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;@31250a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:42:12,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:42:12,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:42:12,902 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:42:12,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:12,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:12,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:42:12,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:12,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash 11008213, now seen corresponding path program 1 times [2025-01-10 00:42:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137635135] [2025-01-10 00:42:12,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:12,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:12,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:42:13,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:42:13,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:13,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:13,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:13,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137635135] [2025-01-10 00:42:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137635135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:13,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:13,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140536084] [2025-01-10 00:42:13,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:13,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:13,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:13,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:13,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:13,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2025-01-10 00:42:13,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:13,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:13,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2025-01-10 00:42:13,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:13,506 INFO L124 PetriNetUnfolderBase]: 183/410 cut-off events. [2025-01-10 00:42:13,506 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 00:42:13,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 410 events. 183/410 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2109 event pairs, 69 based on Foata normal form. 32/437 useless extension candidates. Maximal degree in co-relation 734. Up to 265 conditions per place. [2025-01-10 00:42:13,513 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 25 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2025-01-10 00:42:13,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 155 flow [2025-01-10 00:42:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-01-10 00:42:13,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7456140350877193 [2025-01-10 00:42:13,525 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 78 flow. Second operand 3 states and 85 transitions. [2025-01-10 00:42:13,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 155 flow [2025-01-10 00:42:13,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:13,532 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2025-01-10 00:42:13,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-01-10 00:42:13,536 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-01-10 00:42:13,538 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2025-01-10 00:42:13,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:13,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:13,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:13,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:42:13,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:13,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash 668218751, now seen corresponding path program 1 times [2025-01-10 00:42:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:13,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983525328] [2025-01-10 00:42:13,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:13,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:42:13,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:42:13,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:13,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:13,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983525328] [2025-01-10 00:42:13,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983525328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:13,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:13,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:13,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623934905] [2025-01-10 00:42:13,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:13,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:13,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:13,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:13,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:13,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 38 [2025-01-10 00:42:13,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:13,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:13,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 38 [2025-01-10 00:42:13,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:13,681 INFO L124 PetriNetUnfolderBase]: 159/377 cut-off events. [2025-01-10 00:42:13,681 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 00:42:13,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 377 events. 159/377 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2115 event pairs, 159 based on Foata normal form. 16/376 useless extension candidates. Maximal degree in co-relation 691. Up to 280 conditions per place. [2025-01-10 00:42:13,686 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 14 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2025-01-10 00:42:13,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 100 flow [2025-01-10 00:42:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-01-10 00:42:13,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5701754385964912 [2025-01-10 00:42:13,687 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 3 states and 65 transitions. [2025-01-10 00:42:13,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 100 flow [2025-01-10 00:42:13,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:13,687 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2025-01-10 00:42:13,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-01-10 00:42:13,688 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2025-01-10 00:42:13,688 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2025-01-10 00:42:13,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:13,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:13,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:13,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:42:13,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash 668220093, now seen corresponding path program 1 times [2025-01-10 00:42:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16734746] [2025-01-10 00:42:13,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:13,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:13,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:42:13,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:42:13,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:13,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16734746] [2025-01-10 00:42:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16734746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:13,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21060010] [2025-01-10 00:42:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:13,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:13,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:13,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:13,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2025-01-10 00:42:13,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:13,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:13,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2025-01-10 00:42:13,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:14,164 INFO L124 PetriNetUnfolderBase]: 476/928 cut-off events. [2025-01-10 00:42:14,164 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:14,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1757 conditions, 928 events. 476/928 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5159 event pairs, 200 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1751. Up to 512 conditions per place. [2025-01-10 00:42:14,168 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 24 selfloop transitions, 3 changer transitions 39/75 dead transitions. [2025-01-10 00:42:14,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 75 transitions, 290 flow [2025-01-10 00:42:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:42:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:42:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2025-01-10 00:42:14,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-01-10 00:42:14,170 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 8 states and 164 transitions. [2025-01-10 00:42:14,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 75 transitions, 290 flow [2025-01-10 00:42:14,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 75 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:42:14,172 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 96 flow [2025-01-10 00:42:14,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=96, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2025-01-10 00:42:14,172 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2025-01-10 00:42:14,172 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 96 flow [2025-01-10 00:42:14,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:14,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:14,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:14,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:42:14,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash 19270634, now seen corresponding path program 1 times [2025-01-10 00:42:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:14,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106032322] [2025-01-10 00:42:14,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:14,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:14,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:42:14,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:42:14,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:14,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:14,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106032322] [2025-01-10 00:42:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106032322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:14,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:14,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:14,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714324132] [2025-01-10 00:42:14,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:14,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:14,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:14,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:14,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:14,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2025-01-10 00:42:14,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:14,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:14,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2025-01-10 00:42:14,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:14,531 INFO L124 PetriNetUnfolderBase]: 330/660 cut-off events. [2025-01-10 00:42:14,531 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2025-01-10 00:42:14,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 660 events. 330/660 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3328 event pairs, 186 based on Foata normal form. 24/680 useless extension candidates. Maximal degree in co-relation 1583. Up to 374 conditions per place. [2025-01-10 00:42:14,534 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 26 selfloop transitions, 3 changer transitions 25/63 dead transitions. [2025-01-10 00:42:14,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 294 flow [2025-01-10 00:42:14,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:42:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:42:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-01-10 00:42:14,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5225563909774437 [2025-01-10 00:42:14,537 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 96 flow. Second operand 7 states and 139 transitions. [2025-01-10 00:42:14,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 294 flow [2025-01-10 00:42:14,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 277 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-01-10 00:42:14,539 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 106 flow [2025-01-10 00:42:14,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2025-01-10 00:42:14,540 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2025-01-10 00:42:14,540 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 106 flow [2025-01-10 00:42:14,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:14,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:14,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:14,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:42:14,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:14,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1153464018, now seen corresponding path program 1 times [2025-01-10 00:42:14,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:14,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20333649] [2025-01-10 00:42:14,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:14,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:42:14,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:42:14,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:14,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:14,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:14,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20333649] [2025-01-10 00:42:14,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20333649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:14,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:14,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:42:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969900615] [2025-01-10 00:42:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:14,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:42:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:14,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:42:14,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:42:14,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2025-01-10 00:42:14,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 106 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:14,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:14,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2025-01-10 00:42:14,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:15,148 INFO L124 PetriNetUnfolderBase]: 216/467 cut-off events. [2025-01-10 00:42:15,148 INFO L125 PetriNetUnfolderBase]: For 389/390 co-relation queries the response was YES. [2025-01-10 00:42:15,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 467 events. 216/467 cut-off events. For 389/390 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2306 event pairs, 30 based on Foata normal form. 16/479 useless extension candidates. Maximal degree in co-relation 1119. Up to 278 conditions per place. [2025-01-10 00:42:15,150 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 30 selfloop transitions, 9 changer transitions 25/76 dead transitions. [2025-01-10 00:42:15,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 390 flow [2025-01-10 00:42:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:42:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:42:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 219 transitions. [2025-01-10 00:42:15,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5239234449760766 [2025-01-10 00:42:15,152 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 106 flow. Second operand 11 states and 219 transitions. [2025-01-10 00:42:15,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 390 flow [2025-01-10 00:42:15,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 350 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-01-10 00:42:15,154 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 164 flow [2025-01-10 00:42:15,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=164, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2025-01-10 00:42:15,155 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2025-01-10 00:42:15,155 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 164 flow [2025-01-10 00:42:15,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:15,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:15,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:15,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:42:15,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:15,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash 949088521, now seen corresponding path program 1 times [2025-01-10 00:42:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:15,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590181460] [2025-01-10 00:42:15,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:15,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:42:15,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:42:15,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:15,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:15,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:15,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590181460] [2025-01-10 00:42:15,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590181460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:15,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:15,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:42:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931079616] [2025-01-10 00:42:15,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:15,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:42:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:15,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:42:15,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:42:15,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2025-01-10 00:42:15,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 36 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:15,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:15,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2025-01-10 00:42:15,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:15,372 INFO L124 PetriNetUnfolderBase]: 229/482 cut-off events. [2025-01-10 00:42:15,373 INFO L125 PetriNetUnfolderBase]: For 539/541 co-relation queries the response was YES. [2025-01-10 00:42:15,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 482 events. 229/482 cut-off events. For 539/541 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2193 event pairs, 32 based on Foata normal form. 33/496 useless extension candidates. Maximal degree in co-relation 1256. Up to 207 conditions per place. [2025-01-10 00:42:15,376 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 34 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-01-10 00:42:15,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 281 flow [2025-01-10 00:42:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:42:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:42:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-01-10 00:42:15,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2025-01-10 00:42:15,377 INFO L175 Difference]: Start difference. First operand has 58 places, 36 transitions, 164 flow. Second operand 4 states and 94 transitions. [2025-01-10 00:42:15,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 281 flow [2025-01-10 00:42:15,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 258 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-01-10 00:42:15,381 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 158 flow [2025-01-10 00:42:15,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2025-01-10 00:42:15,382 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-01-10 00:42:15,382 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 158 flow [2025-01-10 00:42:15,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:15,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:15,382 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] [2025-01-10 00:42:15,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:42:15,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:15,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1138677676, now seen corresponding path program 1 times [2025-01-10 00:42:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623631103] [2025-01-10 00:42:15,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:15,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:42:15,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:42:15,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:15,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:15,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:15,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623631103] [2025-01-10 00:42:15,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623631103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:15,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:15,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:15,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110096114] [2025-01-10 00:42:15,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:15,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:15,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:15,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:15,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:15,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2025-01-10 00:42:15,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:15,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:15,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2025-01-10 00:42:15,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:15,625 INFO L124 PetriNetUnfolderBase]: 151/326 cut-off events. [2025-01-10 00:42:15,626 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2025-01-10 00:42:15,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 326 events. 151/326 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1317 event pairs, 34 based on Foata normal form. 20/327 useless extension candidates. Maximal degree in co-relation 894. Up to 130 conditions per place. [2025-01-10 00:42:15,627 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 30 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2025-01-10 00:42:15,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 269 flow [2025-01-10 00:42:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:42:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:42:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-01-10 00:42:15,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578947368421052 [2025-01-10 00:42:15,628 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 158 flow. Second operand 5 states and 106 transitions. [2025-01-10 00:42:15,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 269 flow [2025-01-10 00:42:15,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 239 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-01-10 00:42:15,630 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 162 flow [2025-01-10 00:42:15,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-01-10 00:42:15,630 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2025-01-10 00:42:15,631 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 162 flow [2025-01-10 00:42:15,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:15,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:15,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:15,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:42:15,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:15,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1220580318, now seen corresponding path program 1 times [2025-01-10 00:42:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:15,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272728554] [2025-01-10 00:42:15,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:15,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:42:15,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:15,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:15,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:16,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272728554] [2025-01-10 00:42:16,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272728554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:16,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:42:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480365431] [2025-01-10 00:42:16,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:16,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:42:16,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:16,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:42:16,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:42:16,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-10 00:42:16,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:16,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:16,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-10 00:42:16,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:16,320 INFO L124 PetriNetUnfolderBase]: 151/413 cut-off events. [2025-01-10 00:42:16,320 INFO L125 PetriNetUnfolderBase]: For 389/430 co-relation queries the response was YES. [2025-01-10 00:42:16,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 413 events. 151/413 cut-off events. For 389/430 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2129 event pairs, 60 based on Foata normal form. 10/386 useless extension candidates. Maximal degree in co-relation 1040. Up to 127 conditions per place. [2025-01-10 00:42:16,322 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 23 selfloop transitions, 7 changer transitions 19/68 dead transitions. [2025-01-10 00:42:16,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 340 flow [2025-01-10 00:42:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:42:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:42:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-01-10 00:42:16,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5493421052631579 [2025-01-10 00:42:16,324 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 162 flow. Second operand 8 states and 167 transitions. [2025-01-10 00:42:16,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 340 flow [2025-01-10 00:42:16,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 331 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:16,327 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 195 flow [2025-01-10 00:42:16,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=195, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2025-01-10 00:42:16,327 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2025-01-10 00:42:16,327 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 195 flow [2025-01-10 00:42:16,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:16,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:16,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:16,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:42:16,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:16,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2146725534, now seen corresponding path program 2 times [2025-01-10 00:42:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:16,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854881560] [2025-01-10 00:42:16,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:42:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:16,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:42:16,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:16,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:42:16,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:16,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:16,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854881560] [2025-01-10 00:42:16,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854881560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:16,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:16,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:42:16,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517401779] [2025-01-10 00:42:16,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:16,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:16,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:16,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:16,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:16,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-01-10 00:42:16,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:16,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:16,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-01-10 00:42:16,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:16,668 INFO L124 PetriNetUnfolderBase]: 199/504 cut-off events. [2025-01-10 00:42:16,669 INFO L125 PetriNetUnfolderBase]: For 439/481 co-relation queries the response was YES. [2025-01-10 00:42:16,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 504 events. 199/504 cut-off events. For 439/481 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2622 event pairs, 54 based on Foata normal form. 11/482 useless extension candidates. Maximal degree in co-relation 1408. Up to 192 conditions per place. [2025-01-10 00:42:16,671 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 25 selfloop transitions, 10 changer transitions 19/66 dead transitions. [2025-01-10 00:42:16,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 400 flow [2025-01-10 00:42:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:42:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:42:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2025-01-10 00:42:16,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.462406015037594 [2025-01-10 00:42:16,672 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 195 flow. Second operand 7 states and 123 transitions. [2025-01-10 00:42:16,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 400 flow [2025-01-10 00:42:16,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 386 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-01-10 00:42:16,674 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 223 flow [2025-01-10 00:42:16,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2025-01-10 00:42:16,675 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2025-01-10 00:42:16,675 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 223 flow [2025-01-10 00:42:16,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:16,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:16,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:16,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:42:16,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:16,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:16,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1110479970, now seen corresponding path program 3 times [2025-01-10 00:42:16,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:16,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759576860] [2025-01-10 00:42:16,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:42:16,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:16,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:42:16,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:16,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:42:16,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:16,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:16,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759576860] [2025-01-10 00:42:16,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759576860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:16,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:16,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:42:16,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465324752] [2025-01-10 00:42:16,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:16,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:42:16,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:16,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:42:16,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:42:16,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-01-10 00:42:16,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:16,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:16,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-01-10 00:42:16,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:17,038 INFO L124 PetriNetUnfolderBase]: 174/434 cut-off events. [2025-01-10 00:42:17,038 INFO L125 PetriNetUnfolderBase]: For 381/386 co-relation queries the response was YES. [2025-01-10 00:42:17,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 434 events. 174/434 cut-off events. For 381/386 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2122 event pairs, 66 based on Foata normal form. 6/409 useless extension candidates. Maximal degree in co-relation 1248. Up to 148 conditions per place. [2025-01-10 00:42:17,041 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 21 selfloop transitions, 3 changer transitions 25/61 dead transitions. [2025-01-10 00:42:17,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 393 flow [2025-01-10 00:42:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:42:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:42:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2025-01-10 00:42:17,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2025-01-10 00:42:17,042 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 223 flow. Second operand 8 states and 136 transitions. [2025-01-10 00:42:17,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 393 flow [2025-01-10 00:42:17,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 368 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:42:17,045 INFO L231 Difference]: Finished difference. Result has 65 places, 32 transitions, 154 flow [2025-01-10 00:42:17,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=65, PETRI_TRANSITIONS=32} [2025-01-10 00:42:17,046 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2025-01-10 00:42:17,046 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 32 transitions, 154 flow [2025-01-10 00:42:17,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:17,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:17,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:42:17,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash -794663364, now seen corresponding path program 4 times [2025-01-10 00:42:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442457518] [2025-01-10 00:42:17,047 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:42:17,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:17,056 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 00:42:17,115 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:17,116 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:42:17,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:42:17,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:42:17,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:42:17,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:17,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:17,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:42:17,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:42:17,194 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:42:17,195 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-01-10 00:42:17,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:42:17,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:42:17,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-10 00:42:17,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-10 00:42:17,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:42:17,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:42:17,196 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:17,255 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:42:17,255 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:42:17,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:42:17 BasicIcfg [2025-01-10 00:42:17,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:42:17,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:42:17,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:42:17,259 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:42:17,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:12" (3/4) ... [2025-01-10 00:42:17,260 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:42:17,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:42:17,261 INFO L158 Benchmark]: Toolchain (without parser) took 5516.05ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 110.8MB in the beginning and 149.4MB in the end (delta: -38.6MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-01-10 00:42:17,261 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:17,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.64ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 87.8MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:42:17,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.91ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 86.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:17,262 INFO L158 Benchmark]: Boogie Preprocessor took 43.91ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 83.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:17,262 INFO L158 Benchmark]: RCFGBuilder took 515.89ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 106.3MB in the end (delta: -23.5MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-01-10 00:42:17,262 INFO L158 Benchmark]: TraceAbstraction took 4510.13ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 106.3MB in the beginning and 149.4MB in the end (delta: -43.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-01-10 00:42:17,262 INFO L158 Benchmark]: Witness Printer took 2.19ms. Allocated memory is still 218.1MB. Free memory was 149.4MB in the beginning and 149.4MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:17,264 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.64ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 87.8MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.91ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 86.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.91ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 83.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 515.89ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 106.3MB in the end (delta: -23.5MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4510.13ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 106.3MB in the beginning and 149.4MB in the end (delta: -43.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * Witness Printer took 2.19ms. Allocated memory is still 218.1MB. Free memory was 149.4MB in the beginning and 149.4MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241; [L823] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t242; [L825] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=-2, t242=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 2 z$flush_delayed = weak$$choice2 [L787] 2 z$mem_tmp = z [L788] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L789] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L790] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L791] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L792] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L794] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 __unbuffered_p1_EBX = z [L796] 2 z = z$flush_delayed ? z$mem_tmp : z [L797] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L801] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L802] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L803] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L804] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L807] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=-2, t242=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=-2, t242=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=-2, t242=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L840] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix009.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 34 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=9, InterpolantAutomatonStates: 64, 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.8s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:42:17,279 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix009.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 4dcfd24df13a4fc35e028ca53c41591d13aa2fa957261180f0dd9c1764b57d13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:42:19,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:42:19,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:42:19,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:42:19,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:42:19,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:42:19,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:42:19,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:42:19,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:42:19,263 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:42:19,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:42:19,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:42:19,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:42:19,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:42:19,263 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:42:19,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:42:19,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:42:19,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:42:19,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:19,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:42:19,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:42:19,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:42:19,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:42:19,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:19,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:42:19,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:42:19,266 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:42:19,266 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:42:19,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:42:19,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:42:19,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:42:19,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:42:19,267 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 -> 4dcfd24df13a4fc35e028ca53c41591d13aa2fa957261180f0dd9c1764b57d13 [2025-01-10 00:42:19,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:42:19,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:42:19,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:42:19,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:42:19,500 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:42:19,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix009.oepc.i [2025-01-10 00:42:20,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/869c74f22/5c56fa334dc94c9b8fd200e04383b61b/FLAGac4a537bc [2025-01-10 00:42:20,883 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:42:20,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix009.oepc.i [2025-01-10 00:42:20,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/869c74f22/5c56fa334dc94c9b8fd200e04383b61b/FLAGac4a537bc [2025-01-10 00:42:21,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/869c74f22/5c56fa334dc94c9b8fd200e04383b61b [2025-01-10 00:42:21,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:42:21,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:42:21,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:42:21,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:42:21,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:42:21,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b34b0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21, skipping insertion in model container [2025-01-10 00:42:21,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:42:21,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:42:21,558 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:42:21,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:42:21,633 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:42:21,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21 WrapperNode [2025-01-10 00:42:21,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:42:21,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:42:21,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:42:21,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:42:21,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,671 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118 [2025-01-10 00:42:21,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:42:21,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:42:21,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:42:21,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:42:21,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,704 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:42:21,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:42:21,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:42:21,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:42:21,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:42:21,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (1/1) ... [2025-01-10 00:42:21,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:21,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:21,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:42:21,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:42:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:42:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:42:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:42:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:42:21,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:42:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:42:21,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:42:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:42:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:42:21,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:42:21,774 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:42:21,874 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:42:21,875 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:42:22,123 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:42:22,123 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:42:22,303 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:42:22,303 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:42:22,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:22 BoogieIcfgContainer [2025-01-10 00:42:22,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:42:22,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:42:22,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:42:22,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:42:22,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:42:21" (1/3) ... [2025-01-10 00:42:22,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699198c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:42:22, skipping insertion in model container [2025-01-10 00:42:22,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:21" (2/3) ... [2025-01-10 00:42:22,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699198c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:42:22, skipping insertion in model container [2025-01-10 00:42:22,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:22" (3/3) ... [2025-01-10 00:42:22,310 INFO L128 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2025-01-10 00:42:22,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:42:22,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix009.oepc.i that has 3 procedures, 37 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:42:22,320 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:42:22,367 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:42:22,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 84 flow [2025-01-10 00:42:22,418 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2025-01-10 00:42:22,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:22,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-10 00:42:22,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 84 flow [2025-01-10 00:42:22,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 78 flow [2025-01-10 00:42:22,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:42:22,438 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;@53637ed3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:42:22,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:42:22,444 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:42:22,444 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:42:22,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:22,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:22,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:42:22,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:22,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash 11069781, now seen corresponding path program 1 times [2025-01-10 00:42:22,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:22,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273722939] [2025-01-10 00:42:22,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:22,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:22,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:22,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:42:22,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:42:22,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:42:22,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:42:22,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:22,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:22,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:42:22,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:22,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:22,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:22,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273722939] [2025-01-10 00:42:22,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273722939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:22,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:22,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026540926] [2025-01-10 00:42:22,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:22,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:22,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:22,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:22,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2025-01-10 00:42:22,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:22,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:22,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2025-01-10 00:42:22,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:22,779 INFO L124 PetriNetUnfolderBase]: 183/482 cut-off events. [2025-01-10 00:42:22,779 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 00:42:22,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 482 events. 183/482 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2779 event pairs, 21 based on Foata normal form. 32/509 useless extension candidates. Maximal degree in co-relation 806. Up to 265 conditions per place. [2025-01-10 00:42:22,786 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 25 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2025-01-10 00:42:22,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 155 flow [2025-01-10 00:42:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-01-10 00:42:22,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7456140350877193 [2025-01-10 00:42:22,796 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 78 flow. Second operand 3 states and 85 transitions. [2025-01-10 00:42:22,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 155 flow [2025-01-10 00:42:22,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:22,802 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2025-01-10 00:42:22,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-01-10 00:42:22,806 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-01-10 00:42:22,806 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2025-01-10 00:42:22,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:22,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:22,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:22,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:42:23,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:23,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:23,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1942465535, now seen corresponding path program 1 times [2025-01-10 00:42:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539534166] [2025-01-10 00:42:23,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:23,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:23,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:23,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:42:23,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:42:23,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:42:23,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:42:23,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:23,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:23,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:42:23,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:23,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:23,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:23,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539534166] [2025-01-10 00:42:23,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539534166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:23,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:23,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:23,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517327915] [2025-01-10 00:42:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:23,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:23,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:23,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:23,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 38 [2025-01-10 00:42:23,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:23,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:23,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 38 [2025-01-10 00:42:23,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:23,179 INFO L124 PetriNetUnfolderBase]: 159/377 cut-off events. [2025-01-10 00:42:23,179 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 00:42:23,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 377 events. 159/377 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2093 event pairs, 159 based on Foata normal form. 16/376 useless extension candidates. Maximal degree in co-relation 691. Up to 280 conditions per place. [2025-01-10 00:42:23,184 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 14 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2025-01-10 00:42:23,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 100 flow [2025-01-10 00:42:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-01-10 00:42:23,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5701754385964912 [2025-01-10 00:42:23,186 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 3 states and 65 transitions. [2025-01-10 00:42:23,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 100 flow [2025-01-10 00:42:23,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:23,187 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2025-01-10 00:42:23,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-01-10 00:42:23,187 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2025-01-10 00:42:23,188 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2025-01-10 00:42:23,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:23,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:23,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:23,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:42:23,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:23,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:23,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:23,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1942464193, now seen corresponding path program 1 times [2025-01-10 00:42:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:23,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31837485] [2025-01-10 00:42:23,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:23,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:23,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:23,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:42:23,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:42:23,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:42:23,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:42:23,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:23,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:23,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:42:23,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:23,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:23,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:23,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31837485] [2025-01-10 00:42:23,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31837485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:23,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:23,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:42:23,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822741970] [2025-01-10 00:42:23,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:23,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:42:23,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:23,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:42:23,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:42:23,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2025-01-10 00:42:23,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:23,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:23,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2025-01-10 00:42:23,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:23,608 INFO L124 PetriNetUnfolderBase]: 198/441 cut-off events. [2025-01-10 00:42:23,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:23,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 441 events. 198/441 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2168 event pairs, 38 based on Foata normal form. 25/454 useless extension candidates. Maximal degree in co-relation 815. Up to 191 conditions per place. [2025-01-10 00:42:23,611 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 31 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2025-01-10 00:42:23,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 174 flow [2025-01-10 00:42:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:42:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:42:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-01-10 00:42:23,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2025-01-10 00:42:23,613 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 4 states and 94 transitions. [2025-01-10 00:42:23,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 174 flow [2025-01-10 00:42:23,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:42:23,615 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 89 flow [2025-01-10 00:42:23,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-01-10 00:42:23,615 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-01-10 00:42:23,615 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 89 flow [2025-01-10 00:42:23,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:23,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:23,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:23,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:42:23,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:23,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:23,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2042225214, now seen corresponding path program 1 times [2025-01-10 00:42:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:23,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070930052] [2025-01-10 00:42:23,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:23,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:23,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:23,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:42:23,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:42:23,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:42:23,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:42:23,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:23,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:23,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:42:23,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:23,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:23,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:23,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070930052] [2025-01-10 00:42:23,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070930052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:23,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:23,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:23,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641495201] [2025-01-10 00:42:23,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:23,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:23,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:23,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:23,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2025-01-10 00:42:23,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:23,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:23,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2025-01-10 00:42:23,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:24,042 INFO L124 PetriNetUnfolderBase]: 102/228 cut-off events. [2025-01-10 00:42:24,042 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-01-10 00:42:24,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 228 events. 102/228 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 781 event pairs, 26 based on Foata normal form. 16/235 useless extension candidates. Maximal degree in co-relation 517. Up to 86 conditions per place. [2025-01-10 00:42:24,044 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 26 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2025-01-10 00:42:24,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 186 flow [2025-01-10 00:42:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:42:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:42:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-01-10 00:42:24,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2025-01-10 00:42:24,047 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 89 flow. Second operand 5 states and 105 transitions. [2025-01-10 00:42:24,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 186 flow [2025-01-10 00:42:24,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 177 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:24,049 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 105 flow [2025-01-10 00:42:24,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2025-01-10 00:42:24,049 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-01-10 00:42:24,049 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 105 flow [2025-01-10 00:42:24,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:24,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:24,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:24,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:42:24,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:24,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:24,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:24,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1442803870, now seen corresponding path program 1 times [2025-01-10 00:42:24,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:24,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486633789] [2025-01-10 00:42:24,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:24,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:24,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:24,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:42:24,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:42:24,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:42:24,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:24,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:24,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:24,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 00:42:24,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:24,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:24,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486633789] [2025-01-10 00:42:24,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486633789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:24,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:24,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:42:24,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916100448] [2025-01-10 00:42:24,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:24,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:42:24,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:24,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:42:24,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:42:24,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-10 00:42:24,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 105 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:24,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:24,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-10 00:42:24,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:24,828 INFO L124 PetriNetUnfolderBase]: 99/268 cut-off events. [2025-01-10 00:42:24,828 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-10 00:42:24,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 268 events. 99/268 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1026 event pairs, 19 based on Foata normal form. 4/266 useless extension candidates. Maximal degree in co-relation 582. Up to 59 conditions per place. [2025-01-10 00:42:24,830 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 23 selfloop transitions, 4 changer transitions 20/61 dead transitions. [2025-01-10 00:42:24,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 273 flow [2025-01-10 00:42:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:42:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:42:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2025-01-10 00:42:24,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210526315789473 [2025-01-10 00:42:24,832 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 105 flow. Second operand 10 states and 198 transitions. [2025-01-10 00:42:24,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 273 flow [2025-01-10 00:42:24,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 236 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 00:42:24,843 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 97 flow [2025-01-10 00:42:24,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=97, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2025-01-10 00:42:24,843 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-01-10 00:42:24,843 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 97 flow [2025-01-10 00:42:24,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:24,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:24,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:24,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:42:25,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:25,045 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:25,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash -125740488, now seen corresponding path program 2 times [2025-01-10 00:42:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:25,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168901162] [2025-01-10 00:42:25,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:42:25,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:25,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:25,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:42:25,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:42:25,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:42:25,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:25,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:42:25,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:25,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:42:25,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:25,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:25,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168901162] [2025-01-10 00:42:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168901162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:42:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479596422] [2025-01-10 00:42:25,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:25,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:42:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:25,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:42:25,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:42:25,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-01-10 00:42:25,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 31 transitions, 97 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 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 00:42:25,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:25,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-01-10 00:42:25,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:25,453 INFO L124 PetriNetUnfolderBase]: 169/368 cut-off events. [2025-01-10 00:42:25,453 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-01-10 00:42:25,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 368 events. 169/368 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1391 event pairs, 43 based on Foata normal form. 4/369 useless extension candidates. Maximal degree in co-relation 852. Up to 145 conditions per place. [2025-01-10 00:42:25,455 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 26 selfloop transitions, 4 changer transitions 30/68 dead transitions. [2025-01-10 00:42:25,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 331 flow [2025-01-10 00:42:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:42:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:42:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2025-01-10 00:42:25,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4678362573099415 [2025-01-10 00:42:25,457 INFO L175 Difference]: Start difference. First operand has 52 places, 31 transitions, 97 flow. Second operand 9 states and 160 transitions. [2025-01-10 00:42:25,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 331 flow [2025-01-10 00:42:25,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 295 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-01-10 00:42:25,460 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 102 flow [2025-01-10 00:42:25,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=102, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2025-01-10 00:42:25,461 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-01-10 00:42:25,461 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 102 flow [2025-01-10 00:42:25,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 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 00:42:25,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:25,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:25,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:42:25,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:25,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:42:25,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1756303950, now seen corresponding path program 3 times [2025-01-10 00:42:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:25,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65744765] [2025-01-10 00:42:25,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:42:25,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:25,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:25,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:42:25,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:42:25,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:42:25,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:25,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:42:25,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:42:25,726 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:42:25,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:42:25,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:25,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:25,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:42:25,788 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:42:25,788 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:42:25,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-01-10 00:42:25,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:42:25,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:42:25,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-10 00:42:25,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-10 00:42:25,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:42:25,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:42:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:25,994 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-01-10 00:42:26,040 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:42:26,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:42:26,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:42:26 BasicIcfg [2025-01-10 00:42:26,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:42:26,045 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:42:26,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:42:26,045 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:42:26,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:22" (3/4) ... [2025-01-10 00:42:26,046 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:42:26,047 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:42:26,047 INFO L158 Benchmark]: Toolchain (without parser) took 4825.01ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 61.6MB in the end (delta: 29.6MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2025-01-10 00:42:26,051 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:26,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.69ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.3MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:42:26,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.41ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:26,051 INFO L158 Benchmark]: Boogie Preprocessor took 56.39ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:26,051 INFO L158 Benchmark]: RCFGBuilder took 574.89ms. Allocated memory is still 117.4MB. Free memory was 63.4MB in the beginning and 58.6MB in the end (delta: 4.8MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2025-01-10 00:42:26,052 INFO L158 Benchmark]: TraceAbstraction took 3739.46ms. Allocated memory is still 117.4MB. Free memory was 57.9MB in the beginning and 61.6MB in the end (delta: -3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:26,052 INFO L158 Benchmark]: Witness Printer took 1.98ms. Allocated memory is still 117.4MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:26,052 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.52ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.69ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.3MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.41ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.39ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 574.89ms. Allocated memory is still 117.4MB. Free memory was 63.4MB in the beginning and 58.6MB in the end (delta: 4.8MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3739.46ms. Allocated memory is still 117.4MB. Free memory was 57.9MB in the beginning and 61.6MB in the end (delta: -3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 1.98ms. Allocated memory is still 117.4MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241; [L823] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=31, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t242; [L825] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=31, t242=32, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 2 z$flush_delayed = weak$$choice2 [L787] 2 z$mem_tmp = z [L788] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L789] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L790] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L791] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L792] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L794] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 __unbuffered_p1_EBX = z [L796] 2 z = z$flush_delayed ? z$mem_tmp : z [L797] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L801] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L802] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L803] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L804] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=31, t242=32, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=31, t242=32, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=31, t242=32, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L840] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix009.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 6 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: 3.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 646 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2 mSDtfsCounter, 646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=4, InterpolantAutomatonStates: 34, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 421 SizeOfPredicates, 15 NumberOfNonLiveVariables, 511 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:42:26,066 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: UNKNOWN: Overapproximated counterexample