./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix053.opt.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/mix053.opt.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 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:47:06,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:47:07,015 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:47:07,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:47:07,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:47:07,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:47:07,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:47:07,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:47:07,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:47:07,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:47:07,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:47:07,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:47:07,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:47:07,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:47:07,040 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:47:07,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:47:07,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:47:07,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:47:07,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:47:07,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:47:07,041 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:47:07,041 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:47:07,042 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:47:07,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:47:07,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:47:07,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:47:07,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:47:07,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:47:07,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:47:07,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:47:07,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:07,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:07,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:07,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:07,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:07,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:47:07,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:47:07,044 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 -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 [2025-01-10 00:47:07,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:47:07,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:47:07,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:47:07,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:47:07,273 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:47:07,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix053.opt.i [2025-01-10 00:47:08,428 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a5e5b0a0/1defa6dcad284e86aadbd4ef84b88a07/FLAG8baf309af [2025-01-10 00:47:08,676 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:47:08,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053.opt.i [2025-01-10 00:47:08,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a5e5b0a0/1defa6dcad284e86aadbd4ef84b88a07/FLAG8baf309af [2025-01-10 00:47:08,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a5e5b0a0/1defa6dcad284e86aadbd4ef84b88a07 [2025-01-10 00:47:08,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:47:08,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:47:08,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:08,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:47:08,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:47:08,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:08" (1/1) ... [2025-01-10 00:47:08,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a33c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:08, skipping insertion in model container [2025-01-10 00:47:08,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:08" (1/1) ... [2025-01-10 00:47:08,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:47:08,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:08,960 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:47:09,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:09,037 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:47:09,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09 WrapperNode [2025-01-10 00:47:09,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:09,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:09,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:47:09,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:47:09,044 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:47:09" (1/1) ... [2025-01-10 00:47:09,060 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:47:09" (1/1) ... [2025-01-10 00:47:09,086 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2025-01-10 00:47:09,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:09,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:47:09,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:47:09,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:47:09,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,113 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:47:09,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:47:09,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:47:09,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:47:09,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:47:09,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (1/1) ... [2025-01-10 00:47:09,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:09,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:09,170 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:47:09,173 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:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:47:09,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:47:09,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:47:09,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:47:09,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:47:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:47:09,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:47:09,191 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:47:09,299 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:47:09,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:47:09,541 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:47:09,541 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:47:09,703 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:47:09,703 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:47:09,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:09 BoogieIcfgContainer [2025-01-10 00:47:09,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:47:09,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:47:09,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:47:09,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:47:09,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:47:08" (1/3) ... [2025-01-10 00:47:09,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5226726d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:09, skipping insertion in model container [2025-01-10 00:47:09,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:09" (2/3) ... [2025-01-10 00:47:09,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5226726d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:09, skipping insertion in model container [2025-01-10 00:47:09,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:09" (3/3) ... [2025-01-10 00:47:09,710 INFO L128 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2025-01-10 00:47:09,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:47:09,723 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix053.opt.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:47:09,723 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:47:09,764 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:47:09,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2025-01-10 00:47:09,822 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-01-10 00:47:09,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:09,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-01-10 00:47:09,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2025-01-10 00:47:09,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2025-01-10 00:47:09,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:47:09,854 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;@2fbf8ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:47:09,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:47:09,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:47:09,866 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-10 00:47:09,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:09,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:09,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:09,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:09,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash -448655706, now seen corresponding path program 1 times [2025-01-10 00:47:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:09,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664567697] [2025-01-10 00:47:09,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:09,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:47:09,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:47:09,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:09,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:10,290 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:47:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:10,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664567697] [2025-01-10 00:47:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664567697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:10,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:10,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:10,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810690882] [2025-01-10 00:47:10,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:10,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:10,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:10,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:10,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:10,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2025-01-10 00:47:10,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:47:10,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:10,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2025-01-10 00:47:10,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:10,657 INFO L124 PetriNetUnfolderBase]: 931/1659 cut-off events. [2025-01-10 00:47:10,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:10,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 1659 events. 931/1659 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11844 event pairs, 199 based on Foata normal form. 96/1715 useless extension candidates. Maximal degree in co-relation 3043. Up to 1021 conditions per place. [2025-01-10 00:47:10,676 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2025-01-10 00:47:10,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 190 flow [2025-01-10 00:47:10,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-01-10 00:47:10,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2025-01-10 00:47:10,688 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 119 transitions. [2025-01-10 00:47:10,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 190 flow [2025-01-10 00:47:10,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:10,697 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2025-01-10 00:47:10,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-01-10 00:47:10,703 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-01-10 00:47:10,706 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2025-01-10 00:47:10,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:47:10,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:10,706 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:47:10,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:47:10,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:10,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1374932447, now seen corresponding path program 1 times [2025-01-10 00:47:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:10,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34424143] [2025-01-10 00:47:10,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:10,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:47:10,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:47:10,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:10,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:10,791 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:47:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:10,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34424143] [2025-01-10 00:47:10,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34424143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:10,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:10,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:10,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900307711] [2025-01-10 00:47:10,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:10,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:10,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:10,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:10,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2025-01-10 00:47:10,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:47:10,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:10,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2025-01-10 00:47:10,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:10,992 INFO L124 PetriNetUnfolderBase]: 815/1495 cut-off events. [2025-01-10 00:47:10,993 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-01-10 00:47:11,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 1495 events. 815/1495 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10947 event pairs, 815 based on Foata normal form. 48/1479 useless extension candidates. Maximal degree in co-relation 2799. Up to 1188 conditions per place. [2025-01-10 00:47:11,016 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 19 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-01-10 00:47:11,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 140 flow [2025-01-10 00:47:11,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 00:47:11,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6289308176100629 [2025-01-10 00:47:11,019 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 100 transitions. [2025-01-10 00:47:11,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 140 flow [2025-01-10 00:47:11,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:11,021 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2025-01-10 00:47:11,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-01-10 00:47:11,021 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-01-10 00:47:11,021 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2025-01-10 00:47:11,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:47:11,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:11,024 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:47:11,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:47:11,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:11,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1374933732, now seen corresponding path program 1 times [2025-01-10 00:47:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:11,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537968043] [2025-01-10 00:47:11,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:11,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:11,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:47:11,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:47:11,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:11,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:11,309 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:47:11,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:11,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537968043] [2025-01-10 00:47:11,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537968043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:11,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:11,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:47:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509546492] [2025-01-10 00:47:11,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:11,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:47:11,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:11,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:47:11,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:47:11,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2025-01-10 00:47:11,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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:47:11,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:11,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2025-01-10 00:47:11,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:13,041 INFO L124 PetriNetUnfolderBase]: 12981/19903 cut-off events. [2025-01-10 00:47:13,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:13,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37919 conditions, 19903 events. 12981/19903 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 153506 event pairs, 2970 based on Foata normal form. 0/19306 useless extension candidates. Maximal degree in co-relation 37913. Up to 6477 conditions per place. [2025-01-10 00:47:13,146 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 40 selfloop transitions, 7 changer transitions 79/141 dead transitions. [2025-01-10 00:47:13,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 141 transitions, 548 flow [2025-01-10 00:47:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:47:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:47:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 308 transitions. [2025-01-10 00:47:13,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6457023060796646 [2025-01-10 00:47:13,148 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 9 states and 308 transitions. [2025-01-10 00:47:13,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 141 transitions, 548 flow [2025-01-10 00:47:13,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:47:13,156 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 189 flow [2025-01-10 00:47:13,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2025-01-10 00:47:13,157 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-01-10 00:47:13,157 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 189 flow [2025-01-10 00:47:13,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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:47:13,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:13,157 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:47:13,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:47:13,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:13,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1913618141, now seen corresponding path program 1 times [2025-01-10 00:47:13,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:13,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251617341] [2025-01-10 00:47:13,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:13,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:47:13,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:47:13,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:13,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:13,376 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:47:13,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:13,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251617341] [2025-01-10 00:47:13,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251617341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:13,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:13,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:47:13,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784860032] [2025-01-10 00:47:13,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:13,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:13,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:13,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:13,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:13,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2025-01-10 00:47:13,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:47:13,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:13,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2025-01-10 00:47:13,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:14,927 INFO L124 PetriNetUnfolderBase]: 9622/16145 cut-off events. [2025-01-10 00:47:14,927 INFO L125 PetriNetUnfolderBase]: For 22918/22918 co-relation queries the response was YES. [2025-01-10 00:47:14,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46835 conditions, 16145 events. 9622/16145 cut-off events. For 22918/22918 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 133843 event pairs, 916 based on Foata normal form. 388/16432 useless extension candidates. Maximal degree in co-relation 46820. Up to 5776 conditions per place. [2025-01-10 00:47:15,021 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 55 selfloop transitions, 11 changer transitions 78/159 dead transitions. [2025-01-10 00:47:15,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 159 transitions, 1037 flow [2025-01-10 00:47:15,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:47:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:47:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 334 transitions. [2025-01-10 00:47:15,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.630188679245283 [2025-01-10 00:47:15,023 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 189 flow. Second operand 10 states and 334 transitions. [2025-01-10 00:47:15,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 159 transitions, 1037 flow [2025-01-10 00:47:15,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 159 transitions, 907 flow, removed 31 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:15,073 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 287 flow [2025-01-10 00:47:15,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=287, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2025-01-10 00:47:15,073 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2025-01-10 00:47:15,073 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 287 flow [2025-01-10 00:47:15,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:47:15,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:15,074 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:47:15,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:47:15,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:15,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash -711788445, now seen corresponding path program 1 times [2025-01-10 00:47:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:15,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768347753] [2025-01-10 00:47:15,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:15,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:47:15,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:47:15,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:15,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:15,202 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:47:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768347753] [2025-01-10 00:47:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768347753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:15,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:47:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087597907] [2025-01-10 00:47:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:15,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:47:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:15,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:47:15,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:47:15,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2025-01-10 00:47:15,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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:47:15,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:15,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2025-01-10 00:47:15,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:16,337 INFO L124 PetriNetUnfolderBase]: 7283/12694 cut-off events. [2025-01-10 00:47:16,337 INFO L125 PetriNetUnfolderBase]: For 31175/31717 co-relation queries the response was YES. [2025-01-10 00:47:16,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38769 conditions, 12694 events. 7283/12694 cut-off events. For 31175/31717 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 106353 event pairs, 2810 based on Foata normal form. 611/12926 useless extension candidates. Maximal degree in co-relation 38747. Up to 7673 conditions per place. [2025-01-10 00:47:16,433 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 41 selfloop transitions, 6 changer transitions 41/114 dead transitions. [2025-01-10 00:47:16,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 114 transitions, 761 flow [2025-01-10 00:47:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:47:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:47:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2025-01-10 00:47:16,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388140161725068 [2025-01-10 00:47:16,435 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 287 flow. Second operand 7 states and 237 transitions. [2025-01-10 00:47:16,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 114 transitions, 761 flow [2025-01-10 00:47:16,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 745 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-01-10 00:47:16,520 INFO L231 Difference]: Finished difference. Result has 80 places, 59 transitions, 369 flow [2025-01-10 00:47:16,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=80, PETRI_TRANSITIONS=59} [2025-01-10 00:47:16,521 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2025-01-10 00:47:16,521 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 59 transitions, 369 flow [2025-01-10 00:47:16,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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:47:16,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:16,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:16,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:47:16,521 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:16,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash -347764354, now seen corresponding path program 1 times [2025-01-10 00:47:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:16,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686449420] [2025-01-10 00:47:16,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:16,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:47:16,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:47:16,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:16,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:16,645 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:47:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686449420] [2025-01-10 00:47:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686449420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:16,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:16,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:47:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595256924] [2025-01-10 00:47:16,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:16,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:47:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:16,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:47:16,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:47:16,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 00:47:16,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 59 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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:47:16,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:16,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 00:47:16,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:18,680 INFO L124 PetriNetUnfolderBase]: 15892/24839 cut-off events. [2025-01-10 00:47:18,681 INFO L125 PetriNetUnfolderBase]: For 42176/46191 co-relation queries the response was YES. [2025-01-10 00:47:18,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66823 conditions, 24839 events. 15892/24839 cut-off events. For 42176/46191 co-relation queries the response was YES. Maximal size of possible extension queue 1300. Compared 193756 event pairs, 2553 based on Foata normal form. 1278/25319 useless extension candidates. Maximal degree in co-relation 66794. Up to 13738 conditions per place. [2025-01-10 00:47:18,902 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 48 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-01-10 00:47:18,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 87 transitions, 563 flow [2025-01-10 00:47:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:47:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:47:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 00:47:18,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6650943396226415 [2025-01-10 00:47:18,904 INFO L175 Difference]: Start difference. First operand has 80 places, 59 transitions, 369 flow. Second operand 4 states and 141 transitions. [2025-01-10 00:47:18,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 87 transitions, 563 flow [2025-01-10 00:47:18,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 529 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-01-10 00:47:18,973 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 381 flow [2025-01-10 00:47:18,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=381, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2025-01-10 00:47:18,974 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2025-01-10 00:47:18,974 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 381 flow [2025-01-10 00:47:18,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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:47:18,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:18,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:47:18,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:18,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -30358056, now seen corresponding path program 1 times [2025-01-10 00:47:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648250503] [2025-01-10 00:47:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:18,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:47:18,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:47:18,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:18,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:19,139 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:47:19,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:19,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648250503] [2025-01-10 00:47:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648250503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:19,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:19,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911148417] [2025-01-10 00:47:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:19,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:19,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:19,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:19,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:19,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2025-01-10 00:47:19,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:47:19,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:19,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2025-01-10 00:47:19,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:22,236 INFO L124 PetriNetUnfolderBase]: 22474/36385 cut-off events. [2025-01-10 00:47:22,236 INFO L125 PetriNetUnfolderBase]: For 83945/84696 co-relation queries the response was YES. [2025-01-10 00:47:22,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113850 conditions, 36385 events. 22474/36385 cut-off events. For 83945/84696 co-relation queries the response was YES. Maximal size of possible extension queue 1946. Compared 316586 event pairs, 7490 based on Foata normal form. 740/34278 useless extension candidates. Maximal degree in co-relation 113824. Up to 12008 conditions per place. [2025-01-10 00:47:22,859 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 108 selfloop transitions, 29 changer transitions 14/171 dead transitions. [2025-01-10 00:47:22,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 171 transitions, 1219 flow [2025-01-10 00:47:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:47:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:47:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 331 transitions. [2025-01-10 00:47:22,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6245283018867924 [2025-01-10 00:47:22,861 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 381 flow. Second operand 10 states and 331 transitions. [2025-01-10 00:47:22,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 171 transitions, 1219 flow [2025-01-10 00:47:22,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 171 transitions, 1207 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-10 00:47:22,963 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 640 flow [2025-01-10 00:47:22,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=640, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2025-01-10 00:47:22,963 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2025-01-10 00:47:22,963 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 640 flow [2025-01-10 00:47:22,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:47:22,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:22,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:22,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:47:22,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:22,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash 563940492, now seen corresponding path program 1 times [2025-01-10 00:47:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:22,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055907427] [2025-01-10 00:47:22,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:22,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:22,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:47:22,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:47:22,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:22,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:23,063 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:47:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:23,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055907427] [2025-01-10 00:47:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055907427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:47:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600583182] [2025-01-10 00:47:23,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:23,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:47:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:23,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:47:23,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:47:23,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 00:47:23,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 640 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:47:23,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:23,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 00:47:23,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:25,756 INFO L124 PetriNetUnfolderBase]: 21862/33740 cut-off events. [2025-01-10 00:47:25,757 INFO L125 PetriNetUnfolderBase]: For 75716/82591 co-relation queries the response was YES. [2025-01-10 00:47:25,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102300 conditions, 33740 events. 21862/33740 cut-off events. For 75716/82591 co-relation queries the response was YES. Maximal size of possible extension queue 1773. Compared 266228 event pairs, 2247 based on Foata normal form. 1890/34757 useless extension candidates. Maximal degree in co-relation 102265. Up to 15157 conditions per place. [2025-01-10 00:47:26,052 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 66 selfloop transitions, 10 changer transitions 8/124 dead transitions. [2025-01-10 00:47:26,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 124 transitions, 987 flow [2025-01-10 00:47:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:47:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:47:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2025-01-10 00:47:26,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2025-01-10 00:47:26,233 INFO L175 Difference]: Start difference. First operand has 90 places, 80 transitions, 640 flow. Second operand 5 states and 180 transitions. [2025-01-10 00:47:26,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 124 transitions, 987 flow [2025-01-10 00:47:26,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 124 transitions, 951 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-01-10 00:47:26,617 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 587 flow [2025-01-10 00:47:26,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=587, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2025-01-10 00:47:26,618 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 36 predicate places. [2025-01-10 00:47:26,618 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 587 flow [2025-01-10 00:47:26,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:47:26,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:26,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:26,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:47:26,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:26,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1808375498, now seen corresponding path program 1 times [2025-01-10 00:47:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458623480] [2025-01-10 00:47:26,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:26,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:47:26,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:47:26,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:26,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:26,811 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:47:26,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:26,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458623480] [2025-01-10 00:47:26,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458623480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:26,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:26,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:47:26,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61003193] [2025-01-10 00:47:26,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:26,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:26,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:26,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:26,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:26,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 00:47:26,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:47:26,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:26,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 00:47:26,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:29,037 INFO L124 PetriNetUnfolderBase]: 15388/23569 cut-off events. [2025-01-10 00:47:29,037 INFO L125 PetriNetUnfolderBase]: For 51607/59982 co-relation queries the response was YES. [2025-01-10 00:47:29,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77149 conditions, 23569 events. 15388/23569 cut-off events. For 51607/59982 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 176314 event pairs, 882 based on Foata normal form. 1525/24285 useless extension candidates. Maximal degree in co-relation 77110. Up to 7608 conditions per place. [2025-01-10 00:47:29,271 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 77 selfloop transitions, 14 changer transitions 2/132 dead transitions. [2025-01-10 00:47:29,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 132 transitions, 1014 flow [2025-01-10 00:47:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:47:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:47:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-01-10 00:47:29,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6823899371069182 [2025-01-10 00:47:29,272 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 587 flow. Second operand 6 states and 217 transitions. [2025-01-10 00:47:29,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 132 transitions, 1014 flow [2025-01-10 00:47:29,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 132 transitions, 986 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-01-10 00:47:29,321 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 633 flow [2025-01-10 00:47:29,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2025-01-10 00:47:29,322 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2025-01-10 00:47:29,322 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 633 flow [2025-01-10 00:47:29,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:47:29,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:29,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:29,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:47:29,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:29,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:29,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1358168739, now seen corresponding path program 1 times [2025-01-10 00:47:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4869841] [2025-01-10 00:47:29,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:29,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 00:47:29,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 00:47:29,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:29,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:29,466 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:47:29,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:29,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4869841] [2025-01-10 00:47:29,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4869841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:29,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:29,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:29,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928512496] [2025-01-10 00:47:29,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:29,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:47:29,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:29,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:47:29,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:47:29,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 00:47:29,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 633 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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:47:29,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:29,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 00:47:29,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:31,411 INFO L124 PetriNetUnfolderBase]: 13340/20169 cut-off events. [2025-01-10 00:47:31,411 INFO L125 PetriNetUnfolderBase]: For 61790/70240 co-relation queries the response was YES. [2025-01-10 00:47:31,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72120 conditions, 20169 events. 13340/20169 cut-off events. For 61790/70240 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 148988 event pairs, 766 based on Foata normal form. 979/20347 useless extension candidates. Maximal degree in co-relation 72082. Up to 7608 conditions per place. [2025-01-10 00:47:31,547 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 71 selfloop transitions, 18 changer transitions 2/127 dead transitions. [2025-01-10 00:47:31,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 973 flow [2025-01-10 00:47:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:47:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:47:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2025-01-10 00:47:31,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2025-01-10 00:47:31,549 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 633 flow. Second operand 7 states and 238 transitions. [2025-01-10 00:47:31,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 973 flow [2025-01-10 00:47:31,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 127 transitions, 899 flow, removed 29 selfloop flow, removed 11 redundant places. [2025-01-10 00:47:31,751 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 591 flow [2025-01-10 00:47:31,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=591, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-01-10 00:47:31,751 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2025-01-10 00:47:31,751 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 591 flow [2025-01-10 00:47:31,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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:47:31,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:31,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:31,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:47:31,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:31,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1959678978, now seen corresponding path program 1 times [2025-01-10 00:47:31,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:31,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695013050] [2025-01-10 00:47:31,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:31,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:31,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:31,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:31,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:31,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:32,253 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:47:32,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:32,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695013050] [2025-01-10 00:47:32,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695013050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:32,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:32,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:47:32,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112277159] [2025-01-10 00:47:32,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:32,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:47:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:32,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:47:32,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:47:32,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 00:47:32,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 591 flow. Second operand has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 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:47:32,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:32,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 00:47:32,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:34,676 INFO L124 PetriNetUnfolderBase]: 15277/25870 cut-off events. [2025-01-10 00:47:34,676 INFO L125 PetriNetUnfolderBase]: For 86693/90597 co-relation queries the response was YES. [2025-01-10 00:47:34,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89395 conditions, 25870 events. 15277/25870 cut-off events. For 86693/90597 co-relation queries the response was YES. Maximal size of possible extension queue 2027. Compared 228447 event pairs, 2089 based on Foata normal form. 301/23777 useless extension candidates. Maximal degree in co-relation 89363. Up to 8060 conditions per place. [2025-01-10 00:47:34,898 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 100 selfloop transitions, 58 changer transitions 44/232 dead transitions. [2025-01-10 00:47:34,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 232 transitions, 2057 flow [2025-01-10 00:47:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:47:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:47:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 363 transitions. [2025-01-10 00:47:34,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707547169811321 [2025-01-10 00:47:34,899 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 591 flow. Second operand 12 states and 363 transitions. [2025-01-10 00:47:34,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 232 transitions, 2057 flow [2025-01-10 00:47:35,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 232 transitions, 1894 flow, removed 70 selfloop flow, removed 7 redundant places. [2025-01-10 00:47:35,596 INFO L231 Difference]: Finished difference. Result has 102 places, 129 transitions, 1212 flow [2025-01-10 00:47:35,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1212, PETRI_PLACES=102, PETRI_TRANSITIONS=129} [2025-01-10 00:47:35,597 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 42 predicate places. [2025-01-10 00:47:35,597 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 129 transitions, 1212 flow [2025-01-10 00:47:35,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 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:47:35,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:35,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:35,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:47:35,597 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:35,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:35,598 INFO L85 PathProgramCache]: Analyzing trace with hash -225133278, now seen corresponding path program 2 times [2025-01-10 00:47:35,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:35,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506304981] [2025-01-10 00:47:35,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:47:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:35,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:35,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:35,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:47:35,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:35,801 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:47:35,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506304981] [2025-01-10 00:47:35,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506304981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:35,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:35,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:35,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896590326] [2025-01-10 00:47:35,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:35,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:35,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:35,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:35,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:35,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 00:47:35,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 129 transitions, 1212 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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:47:35,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:35,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 00:47:35,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:37,649 INFO L124 PetriNetUnfolderBase]: 12153/21475 cut-off events. [2025-01-10 00:47:37,649 INFO L125 PetriNetUnfolderBase]: For 75510/77735 co-relation queries the response was YES. [2025-01-10 00:47:37,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76774 conditions, 21475 events. 12153/21475 cut-off events. For 75510/77735 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 193664 event pairs, 2695 based on Foata normal form. 239/19805 useless extension candidates. Maximal degree in co-relation 76736. Up to 7716 conditions per place. [2025-01-10 00:47:37,844 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 89 selfloop transitions, 66 changer transitions 22/207 dead transitions. [2025-01-10 00:47:37,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 207 transitions, 2104 flow [2025-01-10 00:47:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:47:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:47:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2025-01-10 00:47:37,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5983827493261455 [2025-01-10 00:47:37,845 INFO L175 Difference]: Start difference. First operand has 102 places, 129 transitions, 1212 flow. Second operand 7 states and 222 transitions. [2025-01-10 00:47:37,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 207 transitions, 2104 flow [2025-01-10 00:47:38,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 207 transitions, 2047 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:38,504 INFO L231 Difference]: Finished difference. Result has 108 places, 152 transitions, 1752 flow [2025-01-10 00:47:38,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1752, PETRI_PLACES=108, PETRI_TRANSITIONS=152} [2025-01-10 00:47:38,505 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 48 predicate places. [2025-01-10 00:47:38,505 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 152 transitions, 1752 flow [2025-01-10 00:47:38,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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:47:38,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:38,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:38,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:47:38,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:38,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:38,506 INFO L85 PathProgramCache]: Analyzing trace with hash 74881400, now seen corresponding path program 3 times [2025-01-10 00:47:38,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:38,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875693901] [2025-01-10 00:47:38,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:47:38,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:38,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:38,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:38,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:47:38,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:38,644 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:47:38,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:38,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875693901] [2025-01-10 00:47:38,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875693901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:38,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:38,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:38,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009277565] [2025-01-10 00:47:38,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:38,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:38,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:38,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:38,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:38,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2025-01-10 00:47:38,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 152 transitions, 1752 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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:47:38,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:38,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2025-01-10 00:47:38,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:40,633 INFO L124 PetriNetUnfolderBase]: 11661/22179 cut-off events. [2025-01-10 00:47:40,633 INFO L125 PetriNetUnfolderBase]: For 84540/90444 co-relation queries the response was YES. [2025-01-10 00:47:40,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77901 conditions, 22179 events. 11661/22179 cut-off events. For 84540/90444 co-relation queries the response was YES. Maximal size of possible extension queue 1823. Compared 220337 event pairs, 2474 based on Foata normal form. 1232/20928 useless extension candidates. Maximal degree in co-relation 77859. Up to 8750 conditions per place. [2025-01-10 00:47:40,873 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 33 selfloop transitions, 1 changer transitions 110/187 dead transitions. [2025-01-10 00:47:40,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 187 transitions, 2095 flow [2025-01-10 00:47:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:47:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:47:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2025-01-10 00:47:40,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2025-01-10 00:47:40,874 INFO L175 Difference]: Start difference. First operand has 108 places, 152 transitions, 1752 flow. Second operand 6 states and 195 transitions. [2025-01-10 00:47:40,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 187 transitions, 2095 flow [2025-01-10 00:47:41,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 187 transitions, 2079 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:41,694 INFO L231 Difference]: Finished difference. Result has 112 places, 72 transitions, 593 flow [2025-01-10 00:47:41,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=112, PETRI_TRANSITIONS=72} [2025-01-10 00:47:41,694 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 52 predicate places. [2025-01-10 00:47:41,694 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 72 transitions, 593 flow [2025-01-10 00:47:41,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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:47:41,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:41,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:41,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:47:41,695 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:41,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash 989399186, now seen corresponding path program 4 times [2025-01-10 00:47:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:41,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844368590] [2025-01-10 00:47:41,695 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:47:41,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:41,705 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-10 00:47:41,712 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:41,712 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:47:41,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:41,818 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:47:41,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:41,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844368590] [2025-01-10 00:47:41,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844368590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:41,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:41,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:47:41,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384275684] [2025-01-10 00:47:41,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:41,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:47:41,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:41,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:47:41,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:47:41,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2025-01-10 00:47:41,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 72 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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:47:41,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:41,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2025-01-10 00:47:41,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:42,837 INFO L124 PetriNetUnfolderBase]: 4362/8156 cut-off events. [2025-01-10 00:47:42,837 INFO L125 PetriNetUnfolderBase]: For 32966/33647 co-relation queries the response was YES. [2025-01-10 00:47:42,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27798 conditions, 8156 events. 4362/8156 cut-off events. For 32966/33647 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 70726 event pairs, 1837 based on Foata normal form. 76/7043 useless extension candidates. Maximal degree in co-relation 27767. Up to 3087 conditions per place. [2025-01-10 00:47:42,906 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 26 selfloop transitions, 5 changer transitions 25/92 dead transitions. [2025-01-10 00:47:42,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 92 transitions, 769 flow [2025-01-10 00:47:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:47:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:47:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-01-10 00:47:42,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6113207547169811 [2025-01-10 00:47:42,908 INFO L175 Difference]: Start difference. First operand has 112 places, 72 transitions, 593 flow. Second operand 5 states and 162 transitions. [2025-01-10 00:47:42,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 92 transitions, 769 flow [2025-01-10 00:47:42,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 656 flow, removed 21 selfloop flow, removed 14 redundant places. [2025-01-10 00:47:42,989 INFO L231 Difference]: Finished difference. Result has 97 places, 62 transitions, 404 flow [2025-01-10 00:47:42,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=97, PETRI_TRANSITIONS=62} [2025-01-10 00:47:42,990 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 37 predicate places. [2025-01-10 00:47:42,990 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 62 transitions, 404 flow [2025-01-10 00:47:42,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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:47:42,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:42,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:42,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:47:42,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:42,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 859846428, now seen corresponding path program 5 times [2025-01-10 00:47:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:42,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380537721] [2025-01-10 00:47:42,991 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:47:42,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:43,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:43,018 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:43,018 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:47:43,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:43,543 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:47:43,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380537721] [2025-01-10 00:47:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380537721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:43,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:47:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708257053] [2025-01-10 00:47:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:43,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:47:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:43,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:47:43,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:47:43,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2025-01-10 00:47:43,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 62 transitions, 404 flow. Second operand has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 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:47:43,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:43,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2025-01-10 00:47:43,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:44,040 INFO L124 PetriNetUnfolderBase]: 3239/6168 cut-off events. [2025-01-10 00:47:44,040 INFO L125 PetriNetUnfolderBase]: For 8948/9502 co-relation queries the response was YES. [2025-01-10 00:47:44,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16780 conditions, 6168 events. 3239/6168 cut-off events. For 8948/9502 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 51756 event pairs, 1377 based on Foata normal form. 47/5185 useless extension candidates. Maximal degree in co-relation 16756. Up to 2277 conditions per place. [2025-01-10 00:47:44,081 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 31 selfloop transitions, 4 changer transitions 16/92 dead transitions. [2025-01-10 00:47:44,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 592 flow [2025-01-10 00:47:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:47:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:47:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 252 transitions. [2025-01-10 00:47:44,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5943396226415094 [2025-01-10 00:47:44,082 INFO L175 Difference]: Start difference. First operand has 97 places, 62 transitions, 404 flow. Second operand 8 states and 252 transitions. [2025-01-10 00:47:44,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 92 transitions, 592 flow [2025-01-10 00:47:44,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 92 transitions, 534 flow, removed 4 selfloop flow, removed 12 redundant places. [2025-01-10 00:47:44,124 INFO L231 Difference]: Finished difference. Result has 94 places, 64 transitions, 378 flow [2025-01-10 00:47:44,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=94, PETRI_TRANSITIONS=64} [2025-01-10 00:47:44,125 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 34 predicate places. [2025-01-10 00:47:44,125 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 64 transitions, 378 flow [2025-01-10 00:47:44,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 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:47:44,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:44,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:44,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:47:44,125 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:44,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1593438196, now seen corresponding path program 6 times [2025-01-10 00:47:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:44,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715012926] [2025-01-10 00:47:44,126 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:47:44,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:44,137 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:44,160 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:44,160 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 00:47:44,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:47:44,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:47:44,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:44,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:44,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:44,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:47:44,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:47:44,233 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:47:44,233 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:47:44,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:47:44,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:47:44,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:47:44,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:47:44,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:47:44,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:47:44,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:47:44,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:47:44,235 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:44,322 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:47:44,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:47:44,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:47:44 BasicIcfg [2025-01-10 00:47:44,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:47:44,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:47:44,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:47:44,327 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:47:44,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:09" (3/4) ... [2025-01-10 00:47:44,329 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:47:44,330 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:47:44,331 INFO L158 Benchmark]: Toolchain (without parser) took 35626.06ms. Allocated memory was 142.6MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 112.7MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-01-10 00:47:44,331 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:44,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.49ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 89.7MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:47:44,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.73ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:44,332 INFO L158 Benchmark]: Boogie Preprocessor took 47.40ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 84.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:44,332 INFO L158 Benchmark]: RCFGBuilder took 566.41ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 105.9MB in the end (delta: -21.2MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-01-10 00:47:44,333 INFO L158 Benchmark]: TraceAbstraction took 34620.59ms. Allocated memory was 142.6MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 105.2MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-01-10 00:47:44,333 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 10.7GB. Free memory was 8.1GB in the beginning and 8.1GB in the end (delta: 111.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:44,335 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.19ms. Allocated memory is still 226.5MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.49ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 89.7MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.73ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.40ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 84.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 566.41ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 105.9MB in the end (delta: -21.2MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 34620.59ms. Allocated memory was 142.6MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 105.2MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 10.7GB. Free memory was 8.1GB in the beginning and 8.1GB in the end (delta: 111.2kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 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_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, t1414=-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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L819] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L748] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L763] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L766] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 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}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L866] 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}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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", "mix053.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 845]: 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: 851]: 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 9 procedures, 85 locations, 8 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: 34.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 874 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 851 mSDsluCounter, 368 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2175 IncrementalHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 83 mSDtfsCounter, 2175 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1752occurred in iteration=12, InterpolantAutomatonStates: 102, 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.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 1978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:47:44,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/mix053.opt.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 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:47:46,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:47:46,986 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:47:46,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:47:46,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:47:47,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:47:47,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:47:47,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:47:47,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:47:47,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:47:47,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:47:47,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:47:47,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:47:47,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:47:47,011 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:47:47,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:47:47,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:47:47,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:47:47,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:47:47,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:47:47,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:47:47,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:47:47,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:47,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:47,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:47,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:47,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:47:47,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:47,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:47,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:47,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:47,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:47:47,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:47:47,014 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:47:47,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:47:47,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:47:47,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:47:47,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:47:47,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:47:47,014 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 -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 [2025-01-10 00:47:47,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:47:47,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:47:47,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:47:47,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:47:47,273 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:47:47,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix053.opt.i [2025-01-10 00:47:48,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b562af8/fb96085110e24d90bfbd9515a4309635/FLAGd4e85c068 [2025-01-10 00:47:48,655 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:47:48,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053.opt.i [2025-01-10 00:47:48,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b562af8/fb96085110e24d90bfbd9515a4309635/FLAGd4e85c068 [2025-01-10 00:47:48,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b562af8/fb96085110e24d90bfbd9515a4309635 [2025-01-10 00:47:48,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:47:48,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:47:48,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:48,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:47:48,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:47:48,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:48" (1/1) ... [2025-01-10 00:47:48,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7a1510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:48, skipping insertion in model container [2025-01-10 00:47:48,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:48" (1/1) ... [2025-01-10 00:47:48,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:47:49,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:49,019 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:47:49,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:49,092 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:47:49,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49 WrapperNode [2025-01-10 00:47:49,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:49,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:49,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:47:49,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:47:49,099 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:47:49" (1/1) ... [2025-01-10 00:47:49,121 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:47:49" (1/1) ... [2025-01-10 00:47:49,142 INFO L138 Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2025-01-10 00:47:49,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:49,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:47:49,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:47:49,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:47:49,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,173 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:47:49,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:47:49,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:47:49,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:47:49,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:47:49,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (1/1) ... [2025-01-10 00:47:49,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:49,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:49,233 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:47:49,238 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:47:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:47:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:47:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:47:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:47:49,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:47:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:47:49,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:47:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:47:49,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:47:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:47:49,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:47:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:47:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:47:49,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:47:49,253 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:47:49,384 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:47:49,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:47:49,659 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:47:49,659 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:47:49,827 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:47:49,827 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:47:49,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:49 BoogieIcfgContainer [2025-01-10 00:47:49,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:47:49,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:47:49,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:47:49,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:47:49,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:47:48" (1/3) ... [2025-01-10 00:47:49,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d2818b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:49, skipping insertion in model container [2025-01-10 00:47:49,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:49" (2/3) ... [2025-01-10 00:47:49,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d2818b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:49, skipping insertion in model container [2025-01-10 00:47:49,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:49" (3/3) ... [2025-01-10 00:47:49,835 INFO L128 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2025-01-10 00:47:49,846 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:47:49,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix053.opt.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:47:49,847 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:47:49,905 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:47:49,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2025-01-10 00:47:49,961 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-01-10 00:47:49,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:49,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-01-10 00:47:49,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2025-01-10 00:47:49,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2025-01-10 00:47:49,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:47:49,979 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;@7f12abea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:47:49,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:47:49,986 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:47:49,987 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-10 00:47:49,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:49,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:49,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:49,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:49,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash 599884518, now seen corresponding path program 1 times [2025-01-10 00:47:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:49,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977785830] [2025-01-10 00:47:50,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:50,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:50,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:50,003 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:47:50,006 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:47:50,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:47:50,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:47:50,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:50,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:50,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:47:50,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:50,138 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:47:50,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:50,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977785830] [2025-01-10 00:47:50,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977785830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:50,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:50,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168024285] [2025-01-10 00:47:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:50,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:50,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:50,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:50,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:50,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2025-01-10 00:47:50,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:47:50,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:50,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2025-01-10 00:47:50,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:50,579 INFO L124 PetriNetUnfolderBase]: 931/1659 cut-off events. [2025-01-10 00:47:50,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:50,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 1659 events. 931/1659 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11805 event pairs, 199 based on Foata normal form. 96/1722 useless extension candidates. Maximal degree in co-relation 3043. Up to 1021 conditions per place. [2025-01-10 00:47:50,597 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2025-01-10 00:47:50,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 190 flow [2025-01-10 00:47:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-01-10 00:47:50,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2025-01-10 00:47:50,609 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 119 transitions. [2025-01-10 00:47:50,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 190 flow [2025-01-10 00:47:50,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:50,616 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2025-01-10 00:47:50,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-01-10 00:47:50,620 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-01-10 00:47:50,620 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2025-01-10 00:47:50,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:47:50,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:50,620 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:47:50,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:47:50,826 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:47:50,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:50,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:50,827 INFO L85 PathProgramCache]: Analyzing trace with hash 76044513, now seen corresponding path program 1 times [2025-01-10 00:47:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:50,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848040052] [2025-01-10 00:47:50,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:50,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:50,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:50,831 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:47:50,833 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:47:50,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:47:50,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:47:50,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:50,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:50,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:47:50,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:50,934 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:47:50,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:50,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:50,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848040052] [2025-01-10 00:47:50,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848040052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:50,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:50,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:50,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350572377] [2025-01-10 00:47:50,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:50,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:50,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:50,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:50,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:50,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2025-01-10 00:47:50,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:47:50,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:50,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2025-01-10 00:47:50,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:51,139 INFO L124 PetriNetUnfolderBase]: 815/1495 cut-off events. [2025-01-10 00:47:51,139 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-01-10 00:47:51,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 1495 events. 815/1495 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11006 event pairs, 815 based on Foata normal form. 48/1486 useless extension candidates. Maximal degree in co-relation 2799. Up to 1188 conditions per place. [2025-01-10 00:47:51,149 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 19 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-01-10 00:47:51,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 140 flow [2025-01-10 00:47:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 00:47:51,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6289308176100629 [2025-01-10 00:47:51,151 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 100 transitions. [2025-01-10 00:47:51,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 140 flow [2025-01-10 00:47:51,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:51,152 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2025-01-10 00:47:51,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-01-10 00:47:51,153 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-01-10 00:47:51,153 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2025-01-10 00:47:51,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:47:51,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:51,153 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:47:51,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:47:51,354 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:47:51,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:51,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:51,355 INFO L85 PathProgramCache]: Analyzing trace with hash 76045798, now seen corresponding path program 1 times [2025-01-10 00:47:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:51,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145663463] [2025-01-10 00:47:51,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:51,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:51,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:51,358 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:47:51,359 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:47:51,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:47:51,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:47:51,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:51,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:51,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:47:51,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:51,476 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:47:51,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:51,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145663463] [2025-01-10 00:47:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145663463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:51,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:51,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:47:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126458424] [2025-01-10 00:47:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:51,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:47:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:51,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:47:51,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:47:51,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 00:47:51,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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:47:51,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:51,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 00:47:51,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:51,991 INFO L124 PetriNetUnfolderBase]: 3857/6075 cut-off events. [2025-01-10 00:47:51,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:51,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11541 conditions, 6075 events. 3857/6075 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 42136 event pairs, 536 based on Foata normal form. 180/6242 useless extension candidates. Maximal degree in co-relation 11535. Up to 3346 conditions per place. [2025-01-10 00:47:52,019 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 44 selfloop transitions, 6 changer transitions 1/68 dead transitions. [2025-01-10 00:47:52,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 254 flow [2025-01-10 00:47:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:47:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:47:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 00:47:52,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6650943396226415 [2025-01-10 00:47:52,021 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 4 states and 141 transitions. [2025-01-10 00:47:52,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 254 flow [2025-01-10 00:47:52,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:47:52,023 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 135 flow [2025-01-10 00:47:52,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-01-10 00:47:52,024 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2025-01-10 00:47:52,024 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 135 flow [2025-01-10 00:47:52,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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:47:52,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:52,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:52,031 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:47:52,225 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:47:52,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:52,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash -598175143, now seen corresponding path program 1 times [2025-01-10 00:47:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837911009] [2025-01-10 00:47:52,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:52,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:52,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:52,230 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:47:52,231 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:47:52,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:47:52,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:47:52,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:52,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:52,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:47:52,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:52,340 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:47:52,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:52,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837911009] [2025-01-10 00:47:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837911009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:52,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:47:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291566411] [2025-01-10 00:47:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:52,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:47:52,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:52,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:47:52,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:47:52,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 00:47:52,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:47:52,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:52,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 00:47:52,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:52,904 INFO L124 PetriNetUnfolderBase]: 3272/5178 cut-off events. [2025-01-10 00:47:52,904 INFO L125 PetriNetUnfolderBase]: For 1389/1389 co-relation queries the response was YES. [2025-01-10 00:47:52,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11810 conditions, 5178 events. 3272/5178 cut-off events. For 1389/1389 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 34479 event pairs, 192 based on Foata normal form. 174/5339 useless extension candidates. Maximal degree in co-relation 11801. Up to 2581 conditions per place. [2025-01-10 00:47:52,938 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 56 selfloop transitions, 10 changer transitions 1/84 dead transitions. [2025-01-10 00:47:52,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 374 flow [2025-01-10 00:47:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:47:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:47:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-01-10 00:47:52,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6754716981132075 [2025-01-10 00:47:52,940 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 135 flow. Second operand 5 states and 179 transitions. [2025-01-10 00:47:52,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 374 flow [2025-01-10 00:47:52,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 363 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:52,943 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 187 flow [2025-01-10 00:47:52,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-01-10 00:47:52,943 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2025-01-10 00:47:52,943 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 187 flow [2025-01-10 00:47:52,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:47:52,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:52,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:52,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 00:47:53,144 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:47:53,145 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:53,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:53,145 INFO L85 PathProgramCache]: Analyzing trace with hash -163148980, now seen corresponding path program 1 times [2025-01-10 00:47:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:53,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843679014] [2025-01-10 00:47:53,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:53,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:53,148 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:47:53,150 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:47:53,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:47:53,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:47:53,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:53,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:53,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:47:53,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:53,272 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:47:53,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:53,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:53,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843679014] [2025-01-10 00:47:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843679014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:53,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:53,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:47:53,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588468089] [2025-01-10 00:47:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:53,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:53,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:53,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:53,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:53,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 00:47:53,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:47:53,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:53,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 00:47:53,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:53,658 INFO L124 PetriNetUnfolderBase]: 2201/3461 cut-off events. [2025-01-10 00:47:53,659 INFO L125 PetriNetUnfolderBase]: For 2722/2722 co-relation queries the response was YES. [2025-01-10 00:47:53,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8964 conditions, 3461 events. 2201/3461 cut-off events. For 2722/2722 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 20238 event pairs, 69 based on Foata normal form. 140/3588 useless extension candidates. Maximal degree in co-relation 8953. Up to 1221 conditions per place. [2025-01-10 00:47:53,677 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 66 selfloop transitions, 14 changer transitions 1/98 dead transitions. [2025-01-10 00:47:53,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 493 flow [2025-01-10 00:47:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:47:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:47:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-01-10 00:47:53,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761006289308176 [2025-01-10 00:47:53,679 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 187 flow. Second operand 6 states and 215 transitions. [2025-01-10 00:47:53,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 493 flow [2025-01-10 00:47:53,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 463 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:53,684 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 237 flow [2025-01-10 00:47:53,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-01-10 00:47:53,685 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-01-10 00:47:53,685 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 237 flow [2025-01-10 00:47:53,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:47:53,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:53,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:53,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:47:53,890 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:47:53,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:53,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash -580349181, now seen corresponding path program 1 times [2025-01-10 00:47:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:53,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861322168] [2025-01-10 00:47:53,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:53,893 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:47:53,894 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:47:53,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 00:47:53,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 00:47:53,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:53,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:53,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:47:53,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:54,035 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:47:54,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:54,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861322168] [2025-01-10 00:47:54,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861322168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:54,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:54,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:54,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448319414] [2025-01-10 00:47:54,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:54,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:47:54,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:54,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:47:54,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:47:54,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 00:47:54,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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:47:54,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:54,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 00:47:54,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:54,380 INFO L124 PetriNetUnfolderBase]: 1353/2041 cut-off events. [2025-01-10 00:47:54,381 INFO L125 PetriNetUnfolderBase]: For 3006/3006 co-relation queries the response was YES. [2025-01-10 00:47:54,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 2041 events. 1353/2041 cut-off events. For 3006/3006 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9998 event pairs, 39 based on Foata normal form. 72/2100 useless extension candidates. Maximal degree in co-relation 6041. Up to 668 conditions per place. [2025-01-10 00:47:54,391 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 60 selfloop transitions, 18 changer transitions 1/96 dead transitions. [2025-01-10 00:47:54,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 495 flow [2025-01-10 00:47:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:47:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:47:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 235 transitions. [2025-01-10 00:47:54,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.633423180592992 [2025-01-10 00:47:54,393 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 237 flow. Second operand 7 states and 235 transitions. [2025-01-10 00:47:54,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 495 flow [2025-01-10 00:47:54,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 449 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 00:47:54,400 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 247 flow [2025-01-10 00:47:54,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-01-10 00:47:54,401 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2025-01-10 00:47:54,401 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 247 flow [2025-01-10 00:47:54,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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:47:54,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:54,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:54,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:47:54,602 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:47:54,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:54,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash -491422592, now seen corresponding path program 1 times [2025-01-10 00:47:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:54,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409652284] [2025-01-10 00:47:54,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:54,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:54,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:54,606 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:47:54,607 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:47:54,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:54,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:54,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:54,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:54,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:47:54,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:54,772 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:47:54,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:54,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:54,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409652284] [2025-01-10 00:47:54,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409652284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:54,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:54,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:54,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058880399] [2025-01-10 00:47:54,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:54,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:54,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:54,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:54,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:54,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2025-01-10 00:47:54,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:47:54,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:54,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2025-01-10 00:47:54,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:55,078 INFO L124 PetriNetUnfolderBase]: 1791/3151 cut-off events. [2025-01-10 00:47:55,079 INFO L125 PetriNetUnfolderBase]: For 1922/2014 co-relation queries the response was YES. [2025-01-10 00:47:55,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7625 conditions, 3151 events. 1791/3151 cut-off events. For 1922/2014 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 20001 event pairs, 674 based on Foata normal form. 16/2970 useless extension candidates. Maximal degree in co-relation 7612. Up to 1210 conditions per place. [2025-01-10 00:47:55,098 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 33 selfloop transitions, 2 changer transitions 19/84 dead transitions. [2025-01-10 00:47:55,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 433 flow [2025-01-10 00:47:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:47:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:47:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2025-01-10 00:47:55,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6069182389937107 [2025-01-10 00:47:55,100 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 247 flow. Second operand 6 states and 193 transitions. [2025-01-10 00:47:55,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 433 flow [2025-01-10 00:47:55,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 324 flow, removed 22 selfloop flow, removed 10 redundant places. [2025-01-10 00:47:55,110 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 169 flow [2025-01-10 00:47:55,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2025-01-10 00:47:55,110 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2025-01-10 00:47:55,111 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 169 flow [2025-01-10 00:47:55,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:47:55,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:55,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:55,118 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:47:55,311 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:47:55,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:55,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash -229047058, now seen corresponding path program 2 times [2025-01-10 00:47:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:55,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645537591] [2025-01-10 00:47:55,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:47:55,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:55,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:55,316 INFO L229 MonitoredProcess]: Starting monitored process 9 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:47:55,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:47:55,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:55,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:55,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:47:55,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:55,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:47:55,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:55,445 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:47:55,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:55,445 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645537591] [2025-01-10 00:47:55,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645537591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:55,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:55,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:55,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699889191] [2025-01-10 00:47:55,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:55,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:55,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:55,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:55,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:55,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2025-01-10 00:47:55,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:47:55,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:55,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2025-01-10 00:47:55,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:55,801 INFO L124 PetriNetUnfolderBase]: 2876/4901 cut-off events. [2025-01-10 00:47:55,801 INFO L125 PetriNetUnfolderBase]: For 109/117 co-relation queries the response was YES. [2025-01-10 00:47:55,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9815 conditions, 4901 events. 2876/4901 cut-off events. For 109/117 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 34620 event pairs, 1303 based on Foata normal form. 16/4266 useless extension candidates. Maximal degree in co-relation 9804. Up to 2026 conditions per place. [2025-01-10 00:47:55,829 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 36 selfloop transitions, 2 changer transitions 18/87 dead transitions. [2025-01-10 00:47:55,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 358 flow [2025-01-10 00:47:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:47:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:47:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2025-01-10 00:47:55,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2025-01-10 00:47:55,831 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 169 flow. Second operand 6 states and 195 transitions. [2025-01-10 00:47:55,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 358 flow [2025-01-10 00:47:55,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 346 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:55,833 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 179 flow [2025-01-10 00:47:55,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2025-01-10 00:47:55,833 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-01-10 00:47:55,834 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 179 flow [2025-01-10 00:47:55,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:47:55,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:55,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:55,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:47:56,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:56,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:56,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1527600116, now seen corresponding path program 3 times [2025-01-10 00:47:56,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:56,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1487529936] [2025-01-10 00:47:56,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:47:56,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:56,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:56,037 INFO L229 MonitoredProcess]: Starting monitored process 10 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:47:56,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:47:56,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:56,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:56,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:47:56,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:56,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:47:56,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:56,248 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:47:56,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:56,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:56,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487529936] [2025-01-10 00:47:56,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487529936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:56,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:56,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:47:56,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518534905] [2025-01-10 00:47:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:56,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:47:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:56,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:47:56,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:47:56,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 00:47:56,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 179 flow. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 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:47:56,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:56,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 00:47:56,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:57,128 INFO L124 PetriNetUnfolderBase]: 8557/12279 cut-off events. [2025-01-10 00:47:57,128 INFO L125 PetriNetUnfolderBase]: For 2295/3185 co-relation queries the response was YES. [2025-01-10 00:47:57,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28580 conditions, 12279 events. 8557/12279 cut-off events. For 2295/3185 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 77079 event pairs, 2251 based on Foata normal form. 95/11931 useless extension candidates. Maximal degree in co-relation 28568. Up to 7951 conditions per place. [2025-01-10 00:47:57,172 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 55 selfloop transitions, 7 changer transitions 47/125 dead transitions. [2025-01-10 00:47:57,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 125 transitions, 594 flow [2025-01-10 00:47:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:47:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:47:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 265 transitions. [2025-01-10 00:47:57,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-01-10 00:47:57,177 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 179 flow. Second operand 9 states and 265 transitions. [2025-01-10 00:47:57,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 125 transitions, 594 flow [2025-01-10 00:47:57,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 125 transitions, 582 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:57,180 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 211 flow [2025-01-10 00:47:57,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=211, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2025-01-10 00:47:57,180 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2025-01-10 00:47:57,180 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 211 flow [2025-01-10 00:47:57,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 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:47:57,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:57,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:57,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 00:47:57,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:57,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:57,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash -829304458, now seen corresponding path program 4 times [2025-01-10 00:47:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604847027] [2025-01-10 00:47:57,383 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:47:57,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:57,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:57,384 INFO L229 MonitoredProcess]: Starting monitored process 11 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:47:57,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:47:57,443 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-10 00:47:57,463 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 37 statements. [2025-01-10 00:47:57,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 00:47:57,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:57,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 00:47:57,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:57,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:57,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604847027] [2025-01-10 00:47:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604847027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:57,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:57,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:47:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035892176] [2025-01-10 00:47:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:57,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:47:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:57,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:47:57,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:47:57,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2025-01-10 00:47:57,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 211 flow. Second operand has 8 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 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:47:57,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:57,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2025-01-10 00:47:57,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:58,272 INFO L124 PetriNetUnfolderBase]: 4293/7651 cut-off events. [2025-01-10 00:47:58,272 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2025-01-10 00:47:58,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15537 conditions, 7651 events. 4293/7651 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 62125 event pairs, 1666 based on Foata normal form. 16/6886 useless extension candidates. Maximal degree in co-relation 15521. Up to 2475 conditions per place. [2025-01-10 00:47:58,317 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 37 selfloop transitions, 5 changer transitions 21/99 dead transitions. [2025-01-10 00:47:58,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 437 flow [2025-01-10 00:47:58,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:47:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:47:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 289 transitions. [2025-01-10 00:47:58,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6058700209643606 [2025-01-10 00:47:58,319 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 211 flow. Second operand 9 states and 289 transitions. [2025-01-10 00:47:58,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 437 flow [2025-01-10 00:47:58,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 409 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 00:47:58,321 INFO L231 Difference]: Finished difference. Result has 79 places, 62 transitions, 232 flow [2025-01-10 00:47:58,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=79, PETRI_TRANSITIONS=62} [2025-01-10 00:47:58,322 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2025-01-10 00:47:58,322 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 62 transitions, 232 flow [2025-01-10 00:47:58,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 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:47:58,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:58,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:58,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:47:58,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:58,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash 762926982, now seen corresponding path program 5 times [2025-01-10 00:47:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689359814] [2025-01-10 00:47:58,526 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:47:58,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:58,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:58,528 INFO L229 MonitoredProcess]: Starting monitored process 12 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:47:58,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 00:47:58,582 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:47:58,597 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:47:58,597 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:47:58,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:58,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:47:58,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:58,698 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:47:58,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:58,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689359814] [2025-01-10 00:47:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689359814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:58,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:58,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:47:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640541081] [2025-01-10 00:47:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:58,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:47:58,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:58,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:47:58,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:47:58,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 00:47:58,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 62 transitions, 232 flow. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 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:47:58,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:58,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 00:47:58,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:00,057 INFO L124 PetriNetUnfolderBase]: 14593/21373 cut-off events. [2025-01-10 00:48:00,057 INFO L125 PetriNetUnfolderBase]: For 8672/9746 co-relation queries the response was YES. [2025-01-10 00:48:00,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54204 conditions, 21373 events. 14593/21373 cut-off events. For 8672/9746 co-relation queries the response was YES. Maximal size of possible extension queue 1585. Compared 151696 event pairs, 2931 based on Foata normal form. 203/21118 useless extension candidates. Maximal degree in co-relation 54186. Up to 11386 conditions per place. [2025-01-10 00:48:00,123 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 38 selfloop transitions, 6 changer transitions 76/136 dead transitions. [2025-01-10 00:48:00,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 136 transitions, 734 flow [2025-01-10 00:48:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:48:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:48:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 262 transitions. [2025-01-10 00:48:00,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.549266247379455 [2025-01-10 00:48:00,125 INFO L175 Difference]: Start difference. First operand has 79 places, 62 transitions, 232 flow. Second operand 9 states and 262 transitions. [2025-01-10 00:48:00,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 136 transitions, 734 flow [2025-01-10 00:48:00,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 136 transitions, 720 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-10 00:48:00,165 INFO L231 Difference]: Finished difference. Result has 84 places, 56 transitions, 220 flow [2025-01-10 00:48:00,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=84, PETRI_TRANSITIONS=56} [2025-01-10 00:48:00,167 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2025-01-10 00:48:00,167 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 56 transitions, 220 flow [2025-01-10 00:48:00,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 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:48:00,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:00,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:00,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 00:48:00,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:00,368 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:48:00,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2078069578, now seen corresponding path program 6 times [2025-01-10 00:48:00,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:00,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823371033] [2025-01-10 00:48:00,369 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:48:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:00,370 INFO L229 MonitoredProcess]: Starting monitored process 13 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:48:00,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 00:48:00,421 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:48:00,438 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:48:00,438 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 00:48:00,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:00,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:48:00,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:48:00,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:48:00,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:00,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:00,514 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:48:00,514 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:48:00,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:48:00,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:48:00,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:48:00,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:48:00,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:48:00,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:48:00,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:48:00,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:48:00,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 00:48:00,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:00,718 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:00,792 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:48:00,792 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:48:00,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:48:00 BasicIcfg [2025-01-10 00:48:00,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:48:00,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:48:00,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:48:00,796 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:48:00,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:49" (3/4) ... [2025-01-10 00:48:00,798 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:48:00,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:48:00,799 INFO L158 Benchmark]: Toolchain (without parser) took 12109.99ms. Allocated memory was 83.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 58.3MB in the beginning and 650.1MB in the end (delta: -591.8MB). Peak memory consumption was 532.7MB. Max. memory is 16.1GB. [2025-01-10 00:48:00,799 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:00,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.70ms. Allocated memory is still 83.9MB. Free memory was 58.0MB in the beginning and 35.2MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:48:00,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.01ms. Allocated memory is still 83.9MB. Free memory was 35.2MB in the beginning and 32.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:00,800 INFO L158 Benchmark]: Boogie Preprocessor took 56.62ms. Allocated memory is still 83.9MB. Free memory was 32.8MB in the beginning and 30.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:00,800 INFO L158 Benchmark]: RCFGBuilder took 625.26ms. Allocated memory is still 83.9MB. Free memory was 30.1MB in the beginning and 36.6MB in the end (delta: -6.6MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-01-10 00:48:00,800 INFO L158 Benchmark]: TraceAbstraction took 10966.10ms. Allocated memory was 83.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 36.1MB in the beginning and 650.1MB in the end (delta: -614.0MB). Peak memory consumption was 509.4MB. Max. memory is 16.1GB. [2025-01-10 00:48:00,800 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 1.2GB. Free memory was 650.1MB in the beginning and 650.1MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:00,801 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.51ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.70ms. Allocated memory is still 83.9MB. Free memory was 58.0MB in the beginning and 35.2MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.01ms. Allocated memory is still 83.9MB. Free memory was 35.2MB in the beginning and 32.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.62ms. Allocated memory is still 83.9MB. Free memory was 32.8MB in the beginning and 30.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 625.26ms. Allocated memory is still 83.9MB. Free memory was 30.1MB in the beginning and 36.6MB in the end (delta: -6.6MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10966.10ms. Allocated memory was 83.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 36.1MB in the beginning and 650.1MB in the end (delta: -614.0MB). Peak memory consumption was 509.4MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 1.2GB. Free memory was 650.1MB in the beginning and 650.1MB in the end (delta: 30.1kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 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_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-3, 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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-3, t1414=-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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-3, t1414=-2, t1415=-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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-3, t1414=-2, t1415=-1, t1416=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L819] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L748] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L763] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L766] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-3, t1414=-2, t1415=-1, t1416=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 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}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-3, t1414=-2, t1415=-1, t1416=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-3, t1414=-2, t1415=-1, t1416=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L866] 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}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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", "mix053.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 847]: 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: 845]: 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 9 procedures, 85 locations, 8 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: 10.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2144 IncrementalHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 18 mSDtfsCounter, 2144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=6, InterpolantAutomatonStates: 67, 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.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 347 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 953 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1256 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:48:00,817 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