./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/safe003_power.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 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:22:48,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:22:48,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:22:48,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:22:48,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:22:48,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:22:48,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:22:48,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:22:48,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:22:48,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:22:48,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:22:48,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:22:48,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:22:48,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:22:48,988 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:22:48,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:22:48,988 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:22:48,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:22:48,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:22:48,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:22:48,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:22:48,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:22:48,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:22:48,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:22:48,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:22:48,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:22:48,990 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 -> 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 [2025-02-08 08:22:49,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:22:49,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:22:49,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:22:49,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:22:49,249 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:22:49,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2025-02-08 08:22:50,473 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3473d2da6/e38cb09629a54b76b844959b798b084b/FLAGaaf44456a [2025-02-08 08:22:50,794 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:22:50,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2025-02-08 08:22:50,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3473d2da6/e38cb09629a54b76b844959b798b084b/FLAGaaf44456a [2025-02-08 08:22:50,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3473d2da6/e38cb09629a54b76b844959b798b084b [2025-02-08 08:22:50,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:22:50,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:22:50,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:22:50,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:22:50,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:22:50,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:22:50" (1/1) ... [2025-02-08 08:22:50,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51de40af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:50, skipping insertion in model container [2025-02-08 08:22:50,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:22:50" (1/1) ... [2025-02-08 08:22:50,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:22:51,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:22:51,203 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:22:51,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:22:51,316 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:22:51,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51 WrapperNode [2025-02-08 08:22:51,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:22:51,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:22:51,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:22:51,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:22:51,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,352 INFO L138 Inliner]: procedures = 175, calls = 62, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 173 [2025-02-08 08:22:51,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:22:51,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:22:51,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:22:51,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:22:51,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,381 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2025-02-08 08:22:51,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:22:51,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:22:51,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:22:51,401 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:22:51,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (1/1) ... [2025-02-08 08:22:51,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:22:51,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:51,430 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-02-08 08:22:51,433 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-02-08 08:22:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:22:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:22:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:22:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:22:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:22:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:22:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:22:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:22:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:22:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:22:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:22:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:22:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:22:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:22:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:22:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:22:51,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:22:51,453 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:22:51,577 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:22:51,579 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:22:52,088 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:22:52,088 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:22:52,516 WARN L170 LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 08:22:52,581 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:22:52,582 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:22:52,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:22:52 BoogieIcfgContainer [2025-02-08 08:22:52,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:22:52,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:22:52,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:22:52,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:22:52,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:22:50" (1/3) ... [2025-02-08 08:22:52,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cec561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:22:52, skipping insertion in model container [2025-02-08 08:22:52,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:22:51" (2/3) ... [2025-02-08 08:22:52,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cec561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:22:52, skipping insertion in model container [2025-02-08 08:22:52,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:22:52" (3/3) ... [2025-02-08 08:22:52,611 INFO L128 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2025-02-08 08:22:52,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:22:52,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe003_power.opt.i that has 4 procedures, 77 locations, 1 initial locations, 0 loop locations, and 37 error locations. [2025-02-08 08:22:52,633 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:22:52,764 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:22:52,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 87 transitions, 186 flow [2025-02-08 08:22:52,835 INFO L124 PetriNetUnfolderBase]: 11/84 cut-off events. [2025-02-08 08:22:52,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:22:52,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 84 events. 11/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 290 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2025-02-08 08:22:52,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 87 transitions, 186 flow [2025-02-08 08:22:52,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 84 transitions, 177 flow [2025-02-08 08:22:52,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:22:52,858 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;@3aee99f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:22:52,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 08:22:52,862 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:22:52,863 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-02-08 08:22:52,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:22:52,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:52,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:22:52,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:22:52,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash 798879434, now seen corresponding path program 1 times [2025-02-08 08:22:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:22:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381405541] [2025-02-08 08:22:52,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:22:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:22:52,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:22:52,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:22:52,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:52,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:53,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:22:53,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381405541] [2025-02-08 08:22:53,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381405541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:53,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:53,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:22:53,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237366803] [2025-02-08 08:22:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:53,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:22:53,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:22:53,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:22:53,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:22:53,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:22:53,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-02-08 08:22:53,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:53,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:22:53,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:03,158 INFO L124 PetriNetUnfolderBase]: 82933/117725 cut-off events. [2025-02-08 08:23:03,159 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-02-08 08:23:03,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232194 conditions, 117725 events. 82933/117725 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 5016. Compared 918818 event pairs, 30039 based on Foata normal form. 3840/67827 useless extension candidates. Maximal degree in co-relation 232183. Up to 58257 conditions per place. [2025-02-08 08:23:04,067 INFO L140 encePairwiseOnDemand]: 58/87 looper letters, 94 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2025-02-08 08:23:04,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 417 flow [2025-02-08 08:23:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-02-08 08:23:04,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2025-02-08 08:23:04,082 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 177 flow. Second operand 3 states and 177 transitions. [2025-02-08 08:23:04,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 417 flow [2025-02-08 08:23:04,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 104 transitions, 412 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:23:04,094 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 140 flow [2025-02-08 08:23:04,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=122, 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=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2025-02-08 08:23:04,099 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -15 predicate places. [2025-02-08 08:23:04,101 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 140 flow [2025-02-08 08:23:04,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-02-08 08:23:04,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:04,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:23:04,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:23:04,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:04,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1004540473, now seen corresponding path program 1 times [2025-02-08 08:23:04,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:04,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198156413] [2025-02-08 08:23:04,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:04,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:04,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:23:04,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:23:04,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:04,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:04,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198156413] [2025-02-08 08:23:04,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198156413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:04,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:04,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:04,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162661124] [2025-02-08 08:23:04,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:04,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:04,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:04,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:04,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:04,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 08:23:04,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:04,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:04,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:07,994 INFO L124 PetriNetUnfolderBase]: 33531/49985 cut-off events. [2025-02-08 08:23:07,994 INFO L125 PetriNetUnfolderBase]: For 6044/6049 co-relation queries the response was YES. [2025-02-08 08:23:08,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101117 conditions, 49985 events. 33531/49985 cut-off events. For 6044/6049 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 365658 event pairs, 32847 based on Foata normal form. 0/36161 useless extension candidates. Maximal degree in co-relation 101105. Up to 46544 conditions per place. [2025-02-08 08:23:08,293 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-08 08:23:08,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 208 flow [2025-02-08 08:23:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-02-08 08:23:08,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3103448275862069 [2025-02-08 08:23:08,294 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 140 flow. Second operand 3 states and 81 transitions. [2025-02-08 08:23:08,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 208 flow [2025-02-08 08:23:08,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:08,298 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 118 flow [2025-02-08 08:23:08,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-02-08 08:23:08,299 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2025-02-08 08:23:08,299 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 118 flow [2025-02-08 08:23:08,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 08:23:08,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:08,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:23:08,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:23:08,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:08,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1004540472, now seen corresponding path program 1 times [2025-02-08 08:23:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078007095] [2025-02-08 08:23:08,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:08,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:23:08,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:23:08,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:08,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:08,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:08,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078007095] [2025-02-08 08:23:08,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078007095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:08,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:08,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:08,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136926203] [2025-02-08 08:23:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:08,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:08,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:08,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:08,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:08,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 08:23:08,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:08,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:08,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:10,034 INFO L124 PetriNetUnfolderBase]: 10065/15465 cut-off events. [2025-02-08 08:23:10,034 INFO L125 PetriNetUnfolderBase]: For 888/891 co-relation queries the response was YES. [2025-02-08 08:23:10,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31005 conditions, 15465 events. 10065/15465 cut-off events. For 888/891 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 100794 event pairs, 9769 based on Foata normal form. 441/14870 useless extension candidates. Maximal degree in co-relation 30997. Up to 14222 conditions per place. [2025-02-08 08:23:10,125 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 32 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2025-02-08 08:23:10,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 168 flow [2025-02-08 08:23:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-08 08:23:10,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27586206896551724 [2025-02-08 08:23:10,126 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 118 flow. Second operand 3 states and 72 transitions. [2025-02-08 08:23:10,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 168 flow [2025-02-08 08:23:10,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:10,128 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 99 flow [2025-02-08 08:23:10,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-02-08 08:23:10,128 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2025-02-08 08:23:10,129 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 99 flow [2025-02-08 08:23:10,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 08:23:10,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:10,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:10,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:23:10,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:10,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash -253497940, now seen corresponding path program 1 times [2025-02-08 08:23:10,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:10,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408714128] [2025-02-08 08:23:10,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:10,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:23:10,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:23:10,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:10,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:10,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:10,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408714128] [2025-02-08 08:23:10,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408714128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:10,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:10,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:10,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862430818] [2025-02-08 08:23:10,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:10,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:10,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:10,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:10,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:10,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:10,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:10,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:10,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:10,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:11,435 INFO L124 PetriNetUnfolderBase]: 8975/12863 cut-off events. [2025-02-08 08:23:11,435 INFO L125 PetriNetUnfolderBase]: For 677/680 co-relation queries the response was YES. [2025-02-08 08:23:11,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26678 conditions, 12863 events. 8975/12863 cut-off events. For 677/680 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 75455 event pairs, 1005 based on Foata normal form. 0/12026 useless extension candidates. Maximal degree in co-relation 26669. Up to 11851 conditions per place. [2025-02-08 08:23:11,481 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 49 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-02-08 08:23:11,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 249 flow [2025-02-08 08:23:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-08 08:23:11,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3218390804597701 [2025-02-08 08:23:11,482 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 99 flow. Second operand 3 states and 84 transitions. [2025-02-08 08:23:11,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 249 flow [2025-02-08 08:23:11,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:11,483 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 114 flow [2025-02-08 08:23:11,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-02-08 08:23:11,484 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2025-02-08 08:23:11,484 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 114 flow [2025-02-08 08:23:11,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:11,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:11,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:11,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:23:11,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:11,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash -85605833, now seen corresponding path program 1 times [2025-02-08 08:23:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:11,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911906290] [2025-02-08 08:23:11,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:11,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:23:11,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:23:11,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:11,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:11,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:11,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911906290] [2025-02-08 08:23:11,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911906290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:11,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:11,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:23:11,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087936192] [2025-02-08 08:23:11,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:11,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:11,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:11,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:11,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:11,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:11,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-08 08:23:11,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:11,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:11,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:12,456 INFO L124 PetriNetUnfolderBase]: 8245/11833 cut-off events. [2025-02-08 08:23:12,456 INFO L125 PetriNetUnfolderBase]: For 1559/1562 co-relation queries the response was YES. [2025-02-08 08:23:12,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26010 conditions, 11833 events. 8245/11833 cut-off events. For 1559/1562 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 68940 event pairs, 765 based on Foata normal form. 0/11596 useless extension candidates. Maximal degree in co-relation 25999. Up to 10820 conditions per place. [2025-02-08 08:23:12,526 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 48 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-02-08 08:23:12,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 258 flow [2025-02-08 08:23:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-08 08:23:12,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26436781609195403 [2025-02-08 08:23:12,528 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 114 flow. Second operand 4 states and 92 transitions. [2025-02-08 08:23:12,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 258 flow [2025-02-08 08:23:12,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:12,530 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 110 flow [2025-02-08 08:23:12,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2025-02-08 08:23:12,530 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2025-02-08 08:23:12,530 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 110 flow [2025-02-08 08:23:12,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-08 08:23:12,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:12,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:12,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:23:12,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:12,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1201703900, now seen corresponding path program 1 times [2025-02-08 08:23:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090248332] [2025-02-08 08:23:12,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:12,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:23:12,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:23:12,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:12,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:12,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:12,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090248332] [2025-02-08 08:23:12,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090248332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:12,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:12,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:23:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123169678] [2025-02-08 08:23:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:12,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:12,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:12,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:12,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:12,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-08 08:23:12,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:12,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:12,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:13,755 INFO L124 PetriNetUnfolderBase]: 7515/10803 cut-off events. [2025-02-08 08:23:13,755 INFO L125 PetriNetUnfolderBase]: For 1529/1532 co-relation queries the response was YES. [2025-02-08 08:23:13,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23620 conditions, 10803 events. 7515/10803 cut-off events. For 1529/1532 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 62568 event pairs, 525 based on Foata normal form. 300/10866 useless extension candidates. Maximal degree in co-relation 23609. Up to 9790 conditions per place. [2025-02-08 08:23:13,793 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 47 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-02-08 08:23:13,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 252 flow [2025-02-08 08:23:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-08 08:23:13,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2614942528735632 [2025-02-08 08:23:13,794 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 110 flow. Second operand 4 states and 91 transitions. [2025-02-08 08:23:13,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 252 flow [2025-02-08 08:23:13,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 243 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:23:13,800 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 105 flow [2025-02-08 08:23:13,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-02-08 08:23:13,801 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2025-02-08 08:23:13,801 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 105 flow [2025-02-08 08:23:13,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-08 08:23:13,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:13,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:13,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:23:13,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:13,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash -568196217, now seen corresponding path program 1 times [2025-02-08 08:23:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601228432] [2025-02-08 08:23:13,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:13,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:23:13,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:23:13,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:13,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:13,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601228432] [2025-02-08 08:23:13,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601228432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:13,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:13,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6963923] [2025-02-08 08:23:13,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:13,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:13,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:13,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:13,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:13,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:13,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:13,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:13,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:14,563 INFO L124 PetriNetUnfolderBase]: 7515/11627 cut-off events. [2025-02-08 08:23:14,563 INFO L125 PetriNetUnfolderBase]: For 1344/1347 co-relation queries the response was YES. [2025-02-08 08:23:14,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24443 conditions, 11627 events. 7515/11627 cut-off events. For 1344/1347 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 73200 event pairs, 7291 based on Foata normal form. 336/11671 useless extension candidates. Maximal degree in co-relation 24433. Up to 10664 conditions per place. [2025-02-08 08:23:14,622 INFO L140 encePairwiseOnDemand]: 85/87 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2025-02-08 08:23:14,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 165 flow [2025-02-08 08:23:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-08 08:23:14,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2025-02-08 08:23:14,623 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 105 flow. Second operand 3 states and 58 transitions. [2025-02-08 08:23:14,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 165 flow [2025-02-08 08:23:14,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:14,624 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 98 flow [2025-02-08 08:23:14,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2025-02-08 08:23:14,625 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2025-02-08 08:23:14,625 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 98 flow [2025-02-08 08:23:14,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:14,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:14,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:14,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:23:14,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:14,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash -568195888, now seen corresponding path program 1 times [2025-02-08 08:23:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:14,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740123964] [2025-02-08 08:23:14,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:14,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:23:14,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:23:14,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:14,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:14,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740123964] [2025-02-08 08:23:14,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740123964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:14,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:14,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:23:14,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234138535] [2025-02-08 08:23:14,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:14,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:23:14,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:14,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:23:14,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:23:14,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:14,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:14,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:14,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:14,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:16,010 INFO L124 PetriNetUnfolderBase]: 9181/13685 cut-off events. [2025-02-08 08:23:16,011 INFO L125 PetriNetUnfolderBase]: For 840/843 co-relation queries the response was YES. [2025-02-08 08:23:16,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29455 conditions, 13685 events. 9181/13685 cut-off events. For 840/843 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 82525 event pairs, 1264 based on Foata normal form. 0/13113 useless extension candidates. Maximal degree in co-relation 29445. Up to 7833 conditions per place. [2025-02-08 08:23:16,053 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 44 selfloop transitions, 2 changer transitions 80/131 dead transitions. [2025-02-08 08:23:16,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 131 transitions, 624 flow [2025-02-08 08:23:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:23:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:23:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2025-02-08 08:23:16,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27729885057471265 [2025-02-08 08:23:16,055 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 98 flow. Second operand 8 states and 193 transitions. [2025-02-08 08:23:16,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 131 transitions, 624 flow [2025-02-08 08:23:16,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 131 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:16,056 INFO L231 Difference]: Finished difference. Result has 60 places, 35 transitions, 111 flow [2025-02-08 08:23:16,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=60, PETRI_TRANSITIONS=35} [2025-02-08 08:23:16,057 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -23 predicate places. [2025-02-08 08:23:16,057 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 111 flow [2025-02-08 08:23:16,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:16,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:16,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:16,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:23:16,057 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:16,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2015616721, now seen corresponding path program 1 times [2025-02-08 08:23:16,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:16,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391884642] [2025-02-08 08:23:16,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:16,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:16,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:23:16,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:23:16,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:16,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391884642] [2025-02-08 08:23:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391884642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:16,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:23:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382320657] [2025-02-08 08:23:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:23:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:16,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:23:16,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:23:16,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:16,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 35 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:16,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:16,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:16,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:17,580 INFO L124 PetriNetUnfolderBase]: 10611/15680 cut-off events. [2025-02-08 08:23:17,580 INFO L125 PetriNetUnfolderBase]: For 2720/2720 co-relation queries the response was YES. [2025-02-08 08:23:17,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36540 conditions, 15680 events. 10611/15680 cut-off events. For 2720/2720 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 95517 event pairs, 1711 based on Foata normal form. 280/15629 useless extension candidates. Maximal degree in co-relation 36524. Up to 7529 conditions per place. [2025-02-08 08:23:17,655 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 53 selfloop transitions, 4 changer transitions 59/121 dead transitions. [2025-02-08 08:23:17,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 121 transitions, 588 flow [2025-02-08 08:23:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:23:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:23:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-02-08 08:23:17,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2672413793103448 [2025-02-08 08:23:17,656 INFO L175 Difference]: Start difference. First operand has 60 places, 35 transitions, 111 flow. Second operand 8 states and 186 transitions. [2025-02-08 08:23:17,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 121 transitions, 588 flow [2025-02-08 08:23:17,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 121 transitions, 566 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 08:23:17,737 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 141 flow [2025-02-08 08:23:17,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2025-02-08 08:23:17,737 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -22 predicate places. [2025-02-08 08:23:17,737 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 141 flow [2025-02-08 08:23:17,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:17,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:17,738 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-02-08 08:23:17,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:23:17,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:17,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash 659219632, now seen corresponding path program 1 times [2025-02-08 08:23:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:17,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757832762] [2025-02-08 08:23:17,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:17,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:17,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:23:17,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:23:17,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:17,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:17,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:17,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757832762] [2025-02-08 08:23:17,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757832762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:17,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:17,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:23:17,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235124438] [2025-02-08 08:23:17,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:17,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:23:17,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:17,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:23:17,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:23:17,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:17,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:17,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:17,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:17,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:19,523 INFO L124 PetriNetUnfolderBase]: 12162/17970 cut-off events. [2025-02-08 08:23:19,523 INFO L125 PetriNetUnfolderBase]: For 9088/9088 co-relation queries the response was YES. [2025-02-08 08:23:19,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44310 conditions, 17970 events. 12162/17970 cut-off events. For 9088/9088 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 109466 event pairs, 2747 based on Foata normal form. 350/18142 useless extension candidates. Maximal degree in co-relation 44292. Up to 5940 conditions per place. [2025-02-08 08:23:19,596 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 52 selfloop transitions, 3 changer transitions 91/151 dead transitions. [2025-02-08 08:23:19,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 151 transitions, 775 flow [2025-02-08 08:23:19,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:23:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:23:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2025-02-08 08:23:19,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28607918263090676 [2025-02-08 08:23:19,597 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 141 flow. Second operand 9 states and 224 transitions. [2025-02-08 08:23:19,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 151 transitions, 775 flow [2025-02-08 08:23:19,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 151 transitions, 740 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-02-08 08:23:19,669 INFO L231 Difference]: Finished difference. Result has 68 places, 37 transitions, 151 flow [2025-02-08 08:23:19,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=68, PETRI_TRANSITIONS=37} [2025-02-08 08:23:19,669 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -15 predicate places. [2025-02-08 08:23:19,670 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 37 transitions, 151 flow [2025-02-08 08:23:19,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:19,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:19,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:19,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:23:19,670 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:19,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash 876740012, now seen corresponding path program 1 times [2025-02-08 08:23:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:19,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230087246] [2025-02-08 08:23:19,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:19,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:23:19,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:23:19,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:19,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230087246] [2025-02-08 08:23:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230087246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:19,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:19,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:23:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733961707] [2025-02-08 08:23:19,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:19,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:23:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:19,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:23:19,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:23:19,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:19,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 37 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-02-08 08:23:19,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:19,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:19,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:20,642 INFO L124 PetriNetUnfolderBase]: 6257/9413 cut-off events. [2025-02-08 08:23:20,642 INFO L125 PetriNetUnfolderBase]: For 8647/8650 co-relation queries the response was YES. [2025-02-08 08:23:20,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23509 conditions, 9413 events. 6257/9413 cut-off events. For 8647/8650 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 52865 event pairs, 1638 based on Foata normal form. 300/9683 useless extension candidates. Maximal degree in co-relation 23487. Up to 3966 conditions per place. [2025-02-08 08:23:20,685 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 39 selfloop transitions, 2 changer transitions 57/103 dead transitions. [2025-02-08 08:23:20,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 529 flow [2025-02-08 08:23:20,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:23:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:23:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-02-08 08:23:20,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26436781609195403 [2025-02-08 08:23:20,686 INFO L175 Difference]: Start difference. First operand has 68 places, 37 transitions, 151 flow. Second operand 7 states and 161 transitions. [2025-02-08 08:23:20,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 529 flow [2025-02-08 08:23:20,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 492 flow, removed 16 selfloop flow, removed 7 redundant places. [2025-02-08 08:23:20,729 INFO L231 Difference]: Finished difference. Result has 66 places, 33 transitions, 123 flow [2025-02-08 08:23:20,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=123, PETRI_PLACES=66, PETRI_TRANSITIONS=33} [2025-02-08 08:23:20,729 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2025-02-08 08:23:20,729 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 33 transitions, 123 flow [2025-02-08 08:23:20,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-02-08 08:23:20,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:20,730 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-02-08 08:23:20,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:23:20,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:20,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1491722515, now seen corresponding path program 1 times [2025-02-08 08:23:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:20,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479187014] [2025-02-08 08:23:20,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:20,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:20,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:23:20,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:23:20,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:20,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:20,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:20,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479187014] [2025-02-08 08:23:20,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479187014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:20,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:20,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:23:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029701936] [2025-02-08 08:23:20,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:20,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:23:20,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:20,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:23:20,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:23:20,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:20,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 33 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-08 08:23:20,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:20,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:20,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:21,303 INFO L124 PetriNetUnfolderBase]: 2527/3916 cut-off events. [2025-02-08 08:23:21,303 INFO L125 PetriNetUnfolderBase]: For 3402/3402 co-relation queries the response was YES. [2025-02-08 08:23:21,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9761 conditions, 3916 events. 2527/3916 cut-off events. For 3402/3402 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 19061 event pairs, 621 based on Foata normal form. 100/4015 useless extension candidates. Maximal degree in co-relation 9740. Up to 2417 conditions per place. [2025-02-08 08:23:21,318 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 38 selfloop transitions, 2 changer transitions 39/84 dead transitions. [2025-02-08 08:23:21,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 420 flow [2025-02-08 08:23:21,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:23:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:23:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2025-02-08 08:23:21,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23645320197044334 [2025-02-08 08:23:21,319 INFO L175 Difference]: Start difference. First operand has 66 places, 33 transitions, 123 flow. Second operand 7 states and 144 transitions. [2025-02-08 08:23:21,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 420 flow [2025-02-08 08:23:21,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 367 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-02-08 08:23:21,328 INFO L231 Difference]: Finished difference. Result has 63 places, 33 transitions, 113 flow [2025-02-08 08:23:21,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=113, PETRI_PLACES=63, PETRI_TRANSITIONS=33} [2025-02-08 08:23:21,328 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -20 predicate places. [2025-02-08 08:23:21,328 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 33 transitions, 113 flow [2025-02-08 08:23:21,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-08 08:23:21,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:21,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:21,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:23:21,329 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:21,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -134625647, now seen corresponding path program 1 times [2025-02-08 08:23:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:21,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783843414] [2025-02-08 08:23:21,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:21,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:21,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:23:21,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:23:21,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:21,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783843414] [2025-02-08 08:23:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783843414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:21,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:23:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677084290] [2025-02-08 08:23:21,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:21,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:23:21,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:21,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:23:21,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:23:21,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:21,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 33 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-02-08 08:23:21,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:21,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:21,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:21,982 INFO L124 PetriNetUnfolderBase]: 3345/5094 cut-off events. [2025-02-08 08:23:21,982 INFO L125 PetriNetUnfolderBase]: For 2298/2298 co-relation queries the response was YES. [2025-02-08 08:23:21,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11787 conditions, 5094 events. 3345/5094 cut-off events. For 2298/2298 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 25755 event pairs, 377 based on Foata normal form. 80/5173 useless extension candidates. Maximal degree in co-relation 11769. Up to 2732 conditions per place. [2025-02-08 08:23:21,998 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 37 selfloop transitions, 1 changer transitions 39/82 dead transitions. [2025-02-08 08:23:21,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 382 flow [2025-02-08 08:23:21,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:23:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:23:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-02-08 08:23:21,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25287356321839083 [2025-02-08 08:23:21,999 INFO L175 Difference]: Start difference. First operand has 63 places, 33 transitions, 113 flow. Second operand 6 states and 132 transitions. [2025-02-08 08:23:21,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 382 flow [2025-02-08 08:23:22,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 352 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-02-08 08:23:22,008 INFO L231 Difference]: Finished difference. Result has 60 places, 33 transitions, 104 flow [2025-02-08 08:23:22,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=60, PETRI_TRANSITIONS=33} [2025-02-08 08:23:22,009 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -23 predicate places. [2025-02-08 08:23:22,009 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 33 transitions, 104 flow [2025-02-08 08:23:22,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-02-08 08:23:22,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:22,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:22,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:23:22,009 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:22,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:22,010 INFO L85 PathProgramCache]: Analyzing trace with hash -919421105, now seen corresponding path program 2 times [2025-02-08 08:23:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517208067] [2025-02-08 08:23:22,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:23:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:22,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:23:22,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:23:22,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:23:22,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:22,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:22,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517208067] [2025-02-08 08:23:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517208067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:22,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:23:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105106060] [2025-02-08 08:23:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:22,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:23:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:22,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:23:22,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:23:22,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:22,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 33 transitions, 104 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:22,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:22,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:22,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:22,966 INFO L124 PetriNetUnfolderBase]: 2309/3647 cut-off events. [2025-02-08 08:23:22,966 INFO L125 PetriNetUnfolderBase]: For 1850/1850 co-relation queries the response was YES. [2025-02-08 08:23:22,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8152 conditions, 3647 events. 2309/3647 cut-off events. For 1850/1850 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 18274 event pairs, 948 based on Foata normal form. 80/3726 useless extension candidates. Maximal degree in co-relation 8137. Up to 2923 conditions per place. [2025-02-08 08:23:22,978 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 42 selfloop transitions, 5 changer transitions 31/83 dead transitions. [2025-02-08 08:23:22,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 387 flow [2025-02-08 08:23:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:23:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:23:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-02-08 08:23:22,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21839080459770116 [2025-02-08 08:23:22,979 INFO L175 Difference]: Start difference. First operand has 60 places, 33 transitions, 104 flow. Second operand 8 states and 152 transitions. [2025-02-08 08:23:22,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 387 flow [2025-02-08 08:23:22,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 373 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 08:23:22,984 INFO L231 Difference]: Finished difference. Result has 65 places, 36 transitions, 145 flow [2025-02-08 08:23:22,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=145, PETRI_PLACES=65, PETRI_TRANSITIONS=36} [2025-02-08 08:23:22,985 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -18 predicate places. [2025-02-08 08:23:22,985 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 36 transitions, 145 flow [2025-02-08 08:23:22,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:22,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:22,985 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-02-08 08:23:22,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:23:22,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:22,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:22,986 INFO L85 PathProgramCache]: Analyzing trace with hash -903261300, now seen corresponding path program 1 times [2025-02-08 08:23:22,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:22,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734311633] [2025-02-08 08:23:22,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:22,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:23:23,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:23:23,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:23,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:23,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:23,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734311633] [2025-02-08 08:23:23,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734311633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:23,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:23,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:23:23,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878397312] [2025-02-08 08:23:23,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:23,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:23:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:23,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:23:23,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:23:23,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:23,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 36 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-02-08 08:23:23,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:23,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:23,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:24,175 INFO L124 PetriNetUnfolderBase]: 2464/3849 cut-off events. [2025-02-08 08:23:24,175 INFO L125 PetriNetUnfolderBase]: For 4529/4529 co-relation queries the response was YES. [2025-02-08 08:23:24,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11228 conditions, 3849 events. 2464/3849 cut-off events. For 4529/4529 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 19208 event pairs, 378 based on Foata normal form. 84/3932 useless extension candidates. Maximal degree in co-relation 11210. Up to 2195 conditions per place. [2025-02-08 08:23:24,186 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 53 selfloop transitions, 10 changer transitions 55/123 dead transitions. [2025-02-08 08:23:24,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 123 transitions, 726 flow [2025-02-08 08:23:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:23:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:23:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2025-02-08 08:23:24,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22152560083594566 [2025-02-08 08:23:24,187 INFO L175 Difference]: Start difference. First operand has 65 places, 36 transitions, 145 flow. Second operand 11 states and 212 transitions. [2025-02-08 08:23:24,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 123 transitions, 726 flow [2025-02-08 08:23:24,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 705 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 08:23:24,195 INFO L231 Difference]: Finished difference. Result has 75 places, 43 transitions, 245 flow [2025-02-08 08:23:24,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=245, PETRI_PLACES=75, PETRI_TRANSITIONS=43} [2025-02-08 08:23:24,196 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -8 predicate places. [2025-02-08 08:23:24,196 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 43 transitions, 245 flow [2025-02-08 08:23:24,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-02-08 08:23:24,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:24,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:24,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:23:24,196 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:24,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1386915783, now seen corresponding path program 1 times [2025-02-08 08:23:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508951276] [2025-02-08 08:23:24,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:24,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:23:24,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:23:24,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:24,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:24,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:24,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508951276] [2025-02-08 08:23:24,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508951276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:24,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:24,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:23:24,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250450627] [2025-02-08 08:23:24,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:24,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:23:24,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:24,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:23:24,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:23:24,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:24,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 43 transitions, 245 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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-02-08 08:23:24,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:24,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:24,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:25,396 INFO L124 PetriNetUnfolderBase]: 2416/3792 cut-off events. [2025-02-08 08:23:25,396 INFO L125 PetriNetUnfolderBase]: For 12927/12927 co-relation queries the response was YES. [2025-02-08 08:23:25,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14256 conditions, 3792 events. 2416/3792 cut-off events. For 12927/12927 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 19052 event pairs, 384 based on Foata normal form. 69/3860 useless extension candidates. Maximal degree in co-relation 14232. Up to 2198 conditions per place. [2025-02-08 08:23:25,412 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 51 selfloop transitions, 15 changer transitions 39/110 dead transitions. [2025-02-08 08:23:25,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 837 flow [2025-02-08 08:23:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:23:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:23:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2025-02-08 08:23:25,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2260536398467433 [2025-02-08 08:23:25,413 INFO L175 Difference]: Start difference. First operand has 75 places, 43 transitions, 245 flow. Second operand 9 states and 177 transitions. [2025-02-08 08:23:25,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 837 flow [2025-02-08 08:23:25,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 110 transitions, 703 flow, removed 60 selfloop flow, removed 10 redundant places. [2025-02-08 08:23:25,445 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 310 flow [2025-02-08 08:23:25,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=310, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2025-02-08 08:23:25,445 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -11 predicate places. [2025-02-08 08:23:25,446 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 310 flow [2025-02-08 08:23:25,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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-02-08 08:23:25,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:25,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:25,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:23:25,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:25,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1671187568, now seen corresponding path program 1 times [2025-02-08 08:23:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018306457] [2025-02-08 08:23:25,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:25,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:23:25,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:23:25,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:25,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:25,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018306457] [2025-02-08 08:23:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018306457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:23:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42891030] [2025-02-08 08:23:25,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:25,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:25,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:25,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:25,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:25,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-08 08:23:25,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:25,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:25,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:25,899 INFO L124 PetriNetUnfolderBase]: 2019/3265 cut-off events. [2025-02-08 08:23:25,900 INFO L125 PetriNetUnfolderBase]: For 13736/13736 co-relation queries the response was YES. [2025-02-08 08:23:25,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12237 conditions, 3265 events. 2019/3265 cut-off events. For 13736/13736 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16803 event pairs, 228 based on Foata normal form. 167/3431 useless extension candidates. Maximal degree in co-relation 12215. Up to 1721 conditions per place. [2025-02-08 08:23:25,912 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 67 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2025-02-08 08:23:25,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 657 flow [2025-02-08 08:23:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-02-08 08:23:25,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27873563218390807 [2025-02-08 08:23:25,913 INFO L175 Difference]: Start difference. First operand has 72 places, 48 transitions, 310 flow. Second operand 4 states and 97 transitions. [2025-02-08 08:23:25,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 657 flow [2025-02-08 08:23:25,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 579 flow, removed 28 selfloop flow, removed 7 redundant places. [2025-02-08 08:23:25,923 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 271 flow [2025-02-08 08:23:25,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2025-02-08 08:23:25,924 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2025-02-08 08:23:25,924 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 271 flow [2025-02-08 08:23:25,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-08 08:23:25,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:25,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:25,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:23:25,924 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:25,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1429078991, now seen corresponding path program 1 times [2025-02-08 08:23:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94354967] [2025-02-08 08:23:25,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:25,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:23:25,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:23:25,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:25,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:26,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:26,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94354967] [2025-02-08 08:23:26,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94354967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:26,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:26,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:23:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489056743] [2025-02-08 08:23:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:26,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:23:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:26,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:23:26,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:23:26,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:26,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 271 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-02-08 08:23:26,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:26,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:26,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:27,390 INFO L124 PetriNetUnfolderBase]: 1873/3005 cut-off events. [2025-02-08 08:23:27,390 INFO L125 PetriNetUnfolderBase]: For 7521/7521 co-relation queries the response was YES. [2025-02-08 08:23:27,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10937 conditions, 3005 events. 1873/3005 cut-off events. For 7521/7521 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 14501 event pairs, 923 based on Foata normal form. 32/3036 useless extension candidates. Maximal degree in co-relation 10917. Up to 2614 conditions per place. [2025-02-08 08:23:27,402 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 52 selfloop transitions, 9 changer transitions 25/91 dead transitions. [2025-02-08 08:23:27,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 686 flow [2025-02-08 08:23:27,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:23:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:23:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2025-02-08 08:23:27,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20051085568326948 [2025-02-08 08:23:27,404 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 271 flow. Second operand 9 states and 157 transitions. [2025-02-08 08:23:27,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 686 flow [2025-02-08 08:23:27,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 673 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:27,408 INFO L231 Difference]: Finished difference. Result has 78 places, 51 transitions, 345 flow [2025-02-08 08:23:27,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=78, PETRI_TRANSITIONS=51} [2025-02-08 08:23:27,409 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -5 predicate places. [2025-02-08 08:23:27,409 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 51 transitions, 345 flow [2025-02-08 08:23:27,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-02-08 08:23:27,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:27,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:27,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 08:23:27,409 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:27,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1597048685, now seen corresponding path program 1 times [2025-02-08 08:23:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:27,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089700513] [2025-02-08 08:23:27,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:27,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:23:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:23:27,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:27,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089700513] [2025-02-08 08:23:27,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089700513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:27,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:27,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:23:27,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821500966] [2025-02-08 08:23:27,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:27,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:23:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:27,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:23:27,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:23:27,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:27,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 51 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-02-08 08:23:27,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:27,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:27,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:27,818 INFO L124 PetriNetUnfolderBase]: 1304/2151 cut-off events. [2025-02-08 08:23:27,819 INFO L125 PetriNetUnfolderBase]: For 8396/8396 co-relation queries the response was YES. [2025-02-08 08:23:27,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8106 conditions, 2151 events. 1304/2151 cut-off events. For 8396/8396 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10033 event pairs, 126 based on Foata normal form. 128/2278 useless extension candidates. Maximal degree in co-relation 8080. Up to 717 conditions per place. [2025-02-08 08:23:27,827 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 76 selfloop transitions, 8 changer transitions 3/92 dead transitions. [2025-02-08 08:23:27,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 830 flow [2025-02-08 08:23:27,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:23:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:23:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-02-08 08:23:27,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2735632183908046 [2025-02-08 08:23:27,828 INFO L175 Difference]: Start difference. First operand has 78 places, 51 transitions, 345 flow. Second operand 5 states and 119 transitions. [2025-02-08 08:23:27,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 830 flow [2025-02-08 08:23:27,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 92 transitions, 755 flow, removed 32 selfloop flow, removed 6 redundant places. [2025-02-08 08:23:27,834 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 336 flow [2025-02-08 08:23:27,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=336, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2025-02-08 08:23:27,835 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -9 predicate places. [2025-02-08 08:23:27,835 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 336 flow [2025-02-08 08:23:27,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-02-08 08:23:27,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:27,835 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] [2025-02-08 08:23:27,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:23:27,835 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:27,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1667544370, now seen corresponding path program 1 times [2025-02-08 08:23:27,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:27,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753847032] [2025-02-08 08:23:27,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:27,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:23:27,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:23:27,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:27,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:28,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:28,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753847032] [2025-02-08 08:23:28,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753847032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:28,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:28,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:23:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507326709] [2025-02-08 08:23:28,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:28,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:23:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:28,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:23:28,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:23:28,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:28,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:28,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:28,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:28,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:28,241 INFO L124 PetriNetUnfolderBase]: 794/1309 cut-off events. [2025-02-08 08:23:28,241 INFO L125 PetriNetUnfolderBase]: For 4402/4402 co-relation queries the response was YES. [2025-02-08 08:23:28,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 1309 events. 794/1309 cut-off events. For 4402/4402 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5482 event pairs, 98 based on Foata normal form. 52/1360 useless extension candidates. Maximal degree in co-relation 5048. Up to 472 conditions per place. [2025-02-08 08:23:28,246 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 66 selfloop transitions, 11 changer transitions 3/85 dead transitions. [2025-02-08 08:23:28,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 85 transitions, 700 flow [2025-02-08 08:23:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:23:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:23:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2025-02-08 08:23:28,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23946360153256704 [2025-02-08 08:23:28,247 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 336 flow. Second operand 6 states and 125 transitions. [2025-02-08 08:23:28,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 85 transitions, 700 flow [2025-02-08 08:23:28,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 595 flow, removed 26 selfloop flow, removed 8 redundant places. [2025-02-08 08:23:28,255 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 289 flow [2025-02-08 08:23:28,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2025-02-08 08:23:28,255 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -10 predicate places. [2025-02-08 08:23:28,255 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 289 flow [2025-02-08 08:23:28,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:28,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:28,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:28,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:23:28,256 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:28,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:28,257 INFO L85 PathProgramCache]: Analyzing trace with hash -610981319, now seen corresponding path program 1 times [2025-02-08 08:23:28,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:28,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047820702] [2025-02-08 08:23:28,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:28,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:28,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:23:28,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:23:28,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:28,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:23:28,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:23:28,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:23:28,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:23:28,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:28,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:23:28,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:23:28,417 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:23:28,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2025-02-08 08:23:28,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONMEMORY_LEAK (67 of 69 remaining) [2025-02-08 08:23:28,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2025-02-08 08:23:28,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 69 remaining) [2025-02-08 08:23:28,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (32 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONMEMORY_LEAK (28 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2025-02-08 08:23:28,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2025-02-08 08:23:28,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 69 remaining) [2025-02-08 08:23:28,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 69 remaining) [2025-02-08 08:23:28,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 69 remaining) [2025-02-08 08:23:28,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 69 remaining) [2025-02-08 08:23:28,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 69 remaining) [2025-02-08 08:23:28,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 69 remaining) [2025-02-08 08:23:28,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 69 remaining) [2025-02-08 08:23:28,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 69 remaining) [2025-02-08 08:23:28,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 69 remaining) [2025-02-08 08:23:28,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 08:23:28,423 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:28,514 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:23:28,514 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:23:28,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:23:28 BasicIcfg [2025-02-08 08:23:28,517 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:23:28,518 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:23:28,518 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:23:28,518 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:23:28,519 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:22:52" (3/4) ... [2025-02-08 08:23:28,520 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:23:28,520 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:23:28,521 INFO L158 Benchmark]: Toolchain (without parser) took 37684.08ms. Allocated memory was 142.6MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 110.9MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2025-02-08 08:23:28,521 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:28,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.14ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 86.3MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:23:28,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.14ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:28,524 INFO L158 Benchmark]: Boogie Preprocessor took 46.87ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 80.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:23:28,524 INFO L158 Benchmark]: IcfgBuilder took 1181.71ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 51.9MB in the end (delta: 28.2MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-02-08 08:23:28,525 INFO L158 Benchmark]: TraceAbstraction took 35933.13ms. Allocated memory was 142.6MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 51.3MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2025-02-08 08:23:28,525 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 6.4GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 865.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:28,526 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.26ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.14ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 86.3MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.14ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.87ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 80.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1181.71ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 51.9MB in the end (delta: 28.2MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * TraceAbstraction took 35933.13ms. Allocated memory was 142.6MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 51.3MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 6.4GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 865.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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852=5, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1853; [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852=5, t1853=6, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1854; [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1852=5, t1853=6, t1854=7, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L760] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852=5, t1853=6, t1854=7, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852=5, t1853=6, t1854=7, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852=5, t1853=6, t1854=7, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L17] 0 __assert_fail ("0", "safe003_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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 7 procedures, 130 locations, 69 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: 35.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1153 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1144 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3089 IncrementalHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 2 mSDtfsCounter, 3089 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345occurred in iteration=18, InterpolantAutomatonStates: 120, 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.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 2562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-02-08 08:23:28,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe003_power.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 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:23:31,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:23:31,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:23:31,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:23:31,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:23:31,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:23:31,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:23:31,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:23:31,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:23:31,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:23:31,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:23:31,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:23:31,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:23:31,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:23:31,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:23:31,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:23:31,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:23:31,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:23:31,180 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 -> 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 [2025-02-08 08:23:31,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:23:31,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:23:31,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:23:31,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:23:31,406 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:23:31,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2025-02-08 08:23:32,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/163c95d11/8d390dfb97664739a8f93246de07225c/FLAGa69b9f25d [2025-02-08 08:23:32,810 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:23:32,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2025-02-08 08:23:32,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/163c95d11/8d390dfb97664739a8f93246de07225c/FLAGa69b9f25d [2025-02-08 08:23:32,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/163c95d11/8d390dfb97664739a8f93246de07225c [2025-02-08 08:23:32,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:23:32,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:23:32,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:23:32,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:23:32,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:23:32,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517cc019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32, skipping insertion in model container [2025-02-08 08:23:32,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:23:33,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:23:33,138 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:23:33,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:23:33,235 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:23:33,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33 WrapperNode [2025-02-08 08:23:33,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:23:33,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:23:33,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:23:33,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:23:33,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,281 INFO L138 Inliner]: procedures = 179, calls = 62, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2025-02-08 08:23:33,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:23:33,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:23:33,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:23:33,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:23:33,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,318 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2025-02-08 08:23:33,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:23:33,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:23:33,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:23:33,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:23:33,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (1/1) ... [2025-02-08 08:23:33,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:23:33,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:33,386 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-02-08 08:23:33,389 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-02-08 08:23:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-08 08:23:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:23:33,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:23:33,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:23:33,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:23:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:23:33,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:23:33,411 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:23:33,561 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:23:33,563 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:23:34,114 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:23:34,114 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:23:34,551 WARN L170 LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 08:23:34,622 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:23:34,622 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:23:34,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:23:34 BoogieIcfgContainer [2025-02-08 08:23:34,623 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:23:34,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:23:34,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:23:34,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:23:34,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:23:32" (1/3) ... [2025-02-08 08:23:34,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f226f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:23:34, skipping insertion in model container [2025-02-08 08:23:34,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:33" (2/3) ... [2025-02-08 08:23:34,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f226f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:23:34, skipping insertion in model container [2025-02-08 08:23:34,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:23:34" (3/3) ... [2025-02-08 08:23:34,631 INFO L128 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2025-02-08 08:23:34,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:23:34,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe003_power.opt.i that has 4 procedures, 77 locations, 1 initial locations, 0 loop locations, and 37 error locations. [2025-02-08 08:23:34,645 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:23:34,823 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:23:34,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 87 transitions, 186 flow [2025-02-08 08:23:34,889 INFO L124 PetriNetUnfolderBase]: 11/84 cut-off events. [2025-02-08 08:23:34,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:34,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 84 events. 11/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 290 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2025-02-08 08:23:34,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 87 transitions, 186 flow [2025-02-08 08:23:34,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 84 transitions, 177 flow [2025-02-08 08:23:34,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:23:34,927 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;@4356dfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:23:34,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 08:23:34,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:23:34,932 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-02-08 08:23:34,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:34,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:34,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:23:34,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:34,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash 800788044, now seen corresponding path program 1 times [2025-02-08 08:23:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384987553] [2025-02-08 08:23:34,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:34,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:34,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:34,951 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-02-08 08:23:34,953 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-02-08 08:23:35,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:23:35,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:23:35,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:35,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:35,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:23:35,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:35,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:35,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:35,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384987553] [2025-02-08 08:23:35,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384987553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:35,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:35,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785133917] [2025-02-08 08:23:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:35,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:35,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:35,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:35,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:35,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-02-08 08:23:35,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:35,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:35,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:44,851 INFO L124 PetriNetUnfolderBase]: 82933/117725 cut-off events. [2025-02-08 08:23:44,851 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-02-08 08:23:45,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232194 conditions, 117725 events. 82933/117725 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 5016. Compared 918662 event pairs, 30039 based on Foata normal form. 3840/67827 useless extension candidates. Maximal degree in co-relation 232183. Up to 58257 conditions per place. [2025-02-08 08:23:45,581 INFO L140 encePairwiseOnDemand]: 58/87 looper letters, 94 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2025-02-08 08:23:45,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 417 flow [2025-02-08 08:23:45,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-02-08 08:23:45,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2025-02-08 08:23:45,593 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 177 flow. Second operand 3 states and 177 transitions. [2025-02-08 08:23:45,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 417 flow [2025-02-08 08:23:45,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 104 transitions, 412 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:23:45,606 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 140 flow [2025-02-08 08:23:45,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=122, 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=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2025-02-08 08:23:45,611 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -15 predicate places. [2025-02-08 08:23:45,612 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 140 flow [2025-02-08 08:23:45,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-02-08 08:23:45,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:45,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:23:45,623 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-02-08 08:23:45,816 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-02-08 08:23:45,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:45,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash -945373561, now seen corresponding path program 1 times [2025-02-08 08:23:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710375444] [2025-02-08 08:23:45,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:45,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:45,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:45,819 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-02-08 08:23:45,820 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-02-08 08:23:45,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:23:45,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:23:45,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:45,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:45,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:23:45,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:45,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:45,972 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710375444] [2025-02-08 08:23:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710375444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:45,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:45,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276175652] [2025-02-08 08:23:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:45,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:45,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:45,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:45,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:45,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:45,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 08:23:45,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:45,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:45,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:49,596 INFO L124 PetriNetUnfolderBase]: 33531/49985 cut-off events. [2025-02-08 08:23:49,597 INFO L125 PetriNetUnfolderBase]: For 6044/6049 co-relation queries the response was YES. [2025-02-08 08:23:49,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101117 conditions, 49985 events. 33531/49985 cut-off events. For 6044/6049 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 365646 event pairs, 32847 based on Foata normal form. 0/36161 useless extension candidates. Maximal degree in co-relation 101105. Up to 46544 conditions per place. [2025-02-08 08:23:49,871 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-08 08:23:49,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 208 flow [2025-02-08 08:23:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-02-08 08:23:49,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3103448275862069 [2025-02-08 08:23:49,875 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 140 flow. Second operand 3 states and 81 transitions. [2025-02-08 08:23:49,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 208 flow [2025-02-08 08:23:49,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:49,881 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 118 flow [2025-02-08 08:23:49,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-02-08 08:23:49,883 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2025-02-08 08:23:49,883 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 118 flow [2025-02-08 08:23:49,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 08:23:49,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:49,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:23:49,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:23:50,084 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-02-08 08:23:50,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:50,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -945373560, now seen corresponding path program 1 times [2025-02-08 08:23:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:50,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041098826] [2025-02-08 08:23:50,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:50,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:50,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:50,087 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-02-08 08:23:50,088 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-02-08 08:23:50,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:23:50,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:23:50,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:50,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:50,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:23:50,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:50,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:50,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:50,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041098826] [2025-02-08 08:23:50,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041098826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:50,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:50,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918080582] [2025-02-08 08:23:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:50,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:50,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:50,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:50,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:50,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 08:23:50,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:50,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:50,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:51,987 INFO L124 PetriNetUnfolderBase]: 10065/15465 cut-off events. [2025-02-08 08:23:51,987 INFO L125 PetriNetUnfolderBase]: For 888/891 co-relation queries the response was YES. [2025-02-08 08:23:52,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31005 conditions, 15465 events. 10065/15465 cut-off events. For 888/891 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 100797 event pairs, 9769 based on Foata normal form. 441/14870 useless extension candidates. Maximal degree in co-relation 30997. Up to 14222 conditions per place. [2025-02-08 08:23:52,082 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 32 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2025-02-08 08:23:52,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 168 flow [2025-02-08 08:23:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-08 08:23:52,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27586206896551724 [2025-02-08 08:23:52,086 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 118 flow. Second operand 3 states and 72 transitions. [2025-02-08 08:23:52,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 168 flow [2025-02-08 08:23:52,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:52,088 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 99 flow [2025-02-08 08:23:52,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-02-08 08:23:52,088 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2025-02-08 08:23:52,088 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 99 flow [2025-02-08 08:23:52,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 08:23:52,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:52,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:52,096 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-02-08 08:23:52,289 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-02-08 08:23:52,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:52,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1759425646, now seen corresponding path program 1 times [2025-02-08 08:23:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:52,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886604485] [2025-02-08 08:23:52,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:52,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:52,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:52,292 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-02-08 08:23:52,293 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-02-08 08:23:52,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:23:52,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:23:52,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:52,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:52,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:23:52,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:52,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:52,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:52,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886604485] [2025-02-08 08:23:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886604485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197526088] [2025-02-08 08:23:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:52,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:52,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:52,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:52,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:52,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:52,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:52,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:52,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:52,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:53,791 INFO L124 PetriNetUnfolderBase]: 8975/12863 cut-off events. [2025-02-08 08:23:53,791 INFO L125 PetriNetUnfolderBase]: For 677/680 co-relation queries the response was YES. [2025-02-08 08:23:53,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26678 conditions, 12863 events. 8975/12863 cut-off events. For 677/680 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 75490 event pairs, 1005 based on Foata normal form. 0/12026 useless extension candidates. Maximal degree in co-relation 26669. Up to 11851 conditions per place. [2025-02-08 08:23:53,852 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 49 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-02-08 08:23:53,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 249 flow [2025-02-08 08:23:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-08 08:23:53,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3218390804597701 [2025-02-08 08:23:53,854 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 99 flow. Second operand 3 states and 84 transitions. [2025-02-08 08:23:53,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 249 flow [2025-02-08 08:23:53,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:53,855 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 114 flow [2025-02-08 08:23:53,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-02-08 08:23:53,856 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2025-02-08 08:23:53,856 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 114 flow [2025-02-08 08:23:53,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:53,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:53,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:53,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:23:54,056 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-02-08 08:23:54,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:54,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1408980387, now seen corresponding path program 1 times [2025-02-08 08:23:54,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:54,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927654430] [2025-02-08 08:23:54,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:54,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:54,059 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-02-08 08:23:54,061 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-02-08 08:23:54,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:23:54,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:23:54,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:54,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:54,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:23:54,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:54,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:54,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:54,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927654430] [2025-02-08 08:23:54,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927654430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:54,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:54,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:23:54,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197252781] [2025-02-08 08:23:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:54,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:54,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:54,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:54,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:54,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-08 08:23:54,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:54,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:54,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:55,176 INFO L124 PetriNetUnfolderBase]: 8245/11833 cut-off events. [2025-02-08 08:23:55,176 INFO L125 PetriNetUnfolderBase]: For 1559/1562 co-relation queries the response was YES. [2025-02-08 08:23:55,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26010 conditions, 11833 events. 8245/11833 cut-off events. For 1559/1562 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 69107 event pairs, 765 based on Foata normal form. 0/11596 useless extension candidates. Maximal degree in co-relation 25999. Up to 10820 conditions per place. [2025-02-08 08:23:55,233 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 48 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-02-08 08:23:55,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 258 flow [2025-02-08 08:23:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-08 08:23:55,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26436781609195403 [2025-02-08 08:23:55,235 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 114 flow. Second operand 4 states and 92 transitions. [2025-02-08 08:23:55,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 258 flow [2025-02-08 08:23:55,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:55,236 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 110 flow [2025-02-08 08:23:55,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2025-02-08 08:23:55,237 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2025-02-08 08:23:55,237 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 110 flow [2025-02-08 08:23:55,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-08 08:23:55,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:55,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:55,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:23:55,441 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-02-08 08:23:55,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1408980386, now seen corresponding path program 1 times [2025-02-08 08:23:55,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:55,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662188759] [2025-02-08 08:23:55,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:55,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:55,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:55,444 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-02-08 08:23:55,445 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-02-08 08:23:55,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:23:55,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:23:55,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:55,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:55,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:23:55,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:55,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:55,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662188759] [2025-02-08 08:23:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662188759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:23:55,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917798746] [2025-02-08 08:23:55,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:55,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:55,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:55,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:55,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:55,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-08 08:23:55,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:55,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:55,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:56,411 INFO L124 PetriNetUnfolderBase]: 7515/10803 cut-off events. [2025-02-08 08:23:56,411 INFO L125 PetriNetUnfolderBase]: For 1529/1532 co-relation queries the response was YES. [2025-02-08 08:23:56,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23620 conditions, 10803 events. 7515/10803 cut-off events. For 1529/1532 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 62676 event pairs, 525 based on Foata normal form. 300/10866 useless extension candidates. Maximal degree in co-relation 23609. Up to 9790 conditions per place. [2025-02-08 08:23:56,469 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 47 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-02-08 08:23:56,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 252 flow [2025-02-08 08:23:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-08 08:23:56,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2614942528735632 [2025-02-08 08:23:56,470 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 110 flow. Second operand 4 states and 91 transitions. [2025-02-08 08:23:56,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 252 flow [2025-02-08 08:23:56,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 243 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:23:56,473 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 105 flow [2025-02-08 08:23:56,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-02-08 08:23:56,474 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2025-02-08 08:23:56,474 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 105 flow [2025-02-08 08:23:56,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-08 08:23:56,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:56,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:56,481 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-02-08 08:23:56,675 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-02-08 08:23:56,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:56,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1174894135, now seen corresponding path program 1 times [2025-02-08 08:23:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:56,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896316924] [2025-02-08 08:23:56,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:56,678 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-02-08 08:23:56,678 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-02-08 08:23:56,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:23:56,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:23:56,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:56,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:56,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:23:56,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:56,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:56,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:56,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896316924] [2025-02-08 08:23:56,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896316924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:56,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:56,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:56,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544806998] [2025-02-08 08:23:56,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:56,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:56,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:56,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:56,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2025-02-08 08:23:56,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:56,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:56,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2025-02-08 08:23:56,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:57,528 INFO L124 PetriNetUnfolderBase]: 7515/11627 cut-off events. [2025-02-08 08:23:57,528 INFO L125 PetriNetUnfolderBase]: For 1347/1350 co-relation queries the response was YES. [2025-02-08 08:23:57,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24443 conditions, 11627 events. 7515/11627 cut-off events. For 1347/1350 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 73298 event pairs, 7291 based on Foata normal form. 336/11671 useless extension candidates. Maximal degree in co-relation 24433. Up to 10664 conditions per place. [2025-02-08 08:23:57,596 INFO L140 encePairwiseOnDemand]: 85/87 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2025-02-08 08:23:57,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 165 flow [2025-02-08 08:23:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-08 08:23:57,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2025-02-08 08:23:57,597 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 105 flow. Second operand 3 states and 58 transitions. [2025-02-08 08:23:57,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 165 flow [2025-02-08 08:23:57,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:57,599 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 98 flow [2025-02-08 08:23:57,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2025-02-08 08:23:57,599 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2025-02-08 08:23:57,599 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 98 flow [2025-02-08 08:23:57,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:57,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:57,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:57,606 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-02-08 08:23:57,804 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-02-08 08:23:57,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:57,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:57,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1174893806, now seen corresponding path program 1 times [2025-02-08 08:23:57,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:57,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678727834] [2025-02-08 08:23:57,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:57,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:57,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:57,807 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-02-08 08:23:57,808 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-02-08 08:23:57,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:23:57,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:23:57,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:57,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:57,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:23:57,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:57,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:57,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:57,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678727834] [2025-02-08 08:23:57,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678727834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:57,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:57,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:23:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284556891] [2025-02-08 08:23:57,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:57,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:57,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:57,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:57,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:57,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02-08 08:23:57,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:57,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:57,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:58,594 INFO L124 PetriNetUnfolderBase]: 5635/9011 cut-off events. [2025-02-08 08:23:58,594 INFO L125 PetriNetUnfolderBase]: For 480/483 co-relation queries the response was YES. [2025-02-08 08:23:58,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18891 conditions, 9011 events. 5635/9011 cut-off events. For 480/483 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 57519 event pairs, 757 based on Foata normal form. 336/9161 useless extension candidates. Maximal degree in co-relation 18881. Up to 4957 conditions per place. [2025-02-08 08:23:58,634 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 61 selfloop transitions, 5 changer transitions 1/73 dead transitions. [2025-02-08 08:23:58,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 338 flow [2025-02-08 08:23:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-02-08 08:23:58,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3045977011494253 [2025-02-08 08:23:58,635 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 98 flow. Second operand 4 states and 106 transitions. [2025-02-08 08:23:58,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 338 flow [2025-02-08 08:23:58,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:58,637 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 131 flow [2025-02-08 08:23:58,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-02-08 08:23:58,637 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -30 predicate places. [2025-02-08 08:23:58,637 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 131 flow [2025-02-08 08:23:58,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02-08 08:23:58,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:58,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:58,645 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-02-08 08:23:58,842 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-02-08 08:23:58,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:58,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash -323447129, now seen corresponding path program 1 times [2025-02-08 08:23:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:58,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243761858] [2025-02-08 08:23:58,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:58,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:58,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:58,845 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-02-08 08:23:58,846 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-02-08 08:23:58,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:23:58,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:23:58,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:58,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:23:58,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:58,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:58,965 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:58,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243761858] [2025-02-08 08:23:58,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243761858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:58,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:58,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:23:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470717931] [2025-02-08 08:23:58,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:58,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:23:58,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:58,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:23:58,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:23:58,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:58,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:58,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:58,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:58,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:59,447 INFO L124 PetriNetUnfolderBase]: 3219/5175 cut-off events. [2025-02-08 08:23:59,447 INFO L125 PetriNetUnfolderBase]: For 1318/1321 co-relation queries the response was YES. [2025-02-08 08:23:59,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12510 conditions, 5175 events. 3219/5175 cut-off events. For 1318/1321 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 29085 event pairs, 459 based on Foata normal form. 248/5317 useless extension candidates. Maximal degree in co-relation 12497. Up to 1777 conditions per place. [2025-02-08 08:23:59,462 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 76 selfloop transitions, 8 changer transitions 1/91 dead transitions. [2025-02-08 08:23:59,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 460 flow [2025-02-08 08:23:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:23:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:23:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-02-08 08:23:59,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3103448275862069 [2025-02-08 08:23:59,463 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 131 flow. Second operand 5 states and 135 transitions. [2025-02-08 08:23:59,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 460 flow [2025-02-08 08:23:59,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 450 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:59,466 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 171 flow [2025-02-08 08:23:59,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2025-02-08 08:23:59,466 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2025-02-08 08:23:59,467 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 171 flow [2025-02-08 08:23:59,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:59,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:59,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:59,473 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-02-08 08:23:59,667 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-02-08 08:23:59,667 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:23:59,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash 351963903, now seen corresponding path program 1 times [2025-02-08 08:23:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:59,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489789269] [2025-02-08 08:23:59,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:59,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:59,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:59,670 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-02-08 08:23:59,671 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-02-08 08:23:59,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:23:59,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:23:59,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:59,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:59,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:23:59,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:59,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-02-08 08:23:59,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:59,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:59,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489789269] [2025-02-08 08:23:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489789269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:59,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:23:59,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992341969] [2025-02-08 08:23:59,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:59,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:23:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:59,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:23:59,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:23:59,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:23:59,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:59,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:59,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:23:59,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:00,176 INFO L124 PetriNetUnfolderBase]: 1889/2941 cut-off events. [2025-02-08 08:24:00,176 INFO L125 PetriNetUnfolderBase]: For 2134/2137 co-relation queries the response was YES. [2025-02-08 08:24:00,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7968 conditions, 2941 events. 1889/2941 cut-off events. For 2134/2137 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14266 event pairs, 403 based on Foata normal form. 100/2971 useless extension candidates. Maximal degree in co-relation 7953. Up to 1044 conditions per place. [2025-02-08 08:24:00,188 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 64 selfloop transitions, 11 changer transitions 1/82 dead transitions. [2025-02-08 08:24:00,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 437 flow [2025-02-08 08:24:00,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:24:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:24:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-02-08 08:24:00,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26053639846743293 [2025-02-08 08:24:00,189 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 171 flow. Second operand 6 states and 136 transitions. [2025-02-08 08:24:00,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 437 flow [2025-02-08 08:24:00,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 412 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 08:24:00,197 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 185 flow [2025-02-08 08:24:00,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2025-02-08 08:24:00,198 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -23 predicate places. [2025-02-08 08:24:00,198 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 185 flow [2025-02-08 08:24:00,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:00,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:00,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:00,209 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-02-08 08:24:00,398 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-02-08 08:24:00,399 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:24:00,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1197795161, now seen corresponding path program 1 times [2025-02-08 08:24:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:24:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644786521] [2025-02-08 08:24:00,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:00,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:00,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:00,402 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-02-08 08:24:00,403 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-02-08 08:24:00,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:24:00,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:24:00,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:00,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:00,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:24:00,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:24:00,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-02-08 08:24:00,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:24:00,637 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:24:00,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644786521] [2025-02-08 08:24:00,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644786521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:00,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:00,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:24:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124182757] [2025-02-08 08:24:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:00,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:24:00,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:24:00,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:24:00,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:24:00,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:24:00,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 185 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-02-08 08:24:00,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:00,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:24:00,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:01,284 INFO L124 PetriNetUnfolderBase]: 3053/4695 cut-off events. [2025-02-08 08:24:01,285 INFO L125 PetriNetUnfolderBase]: For 4062/4062 co-relation queries the response was YES. [2025-02-08 08:24:01,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13061 conditions, 4695 events. 3053/4695 cut-off events. For 4062/4062 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24460 event pairs, 605 based on Foata normal form. 16/4607 useless extension candidates. Maximal degree in co-relation 13045. Up to 2055 conditions per place. [2025-02-08 08:24:01,304 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 58 selfloop transitions, 9 changer transitions 56/129 dead transitions. [2025-02-08 08:24:01,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 129 transitions, 771 flow [2025-02-08 08:24:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:24:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:24:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2025-02-08 08:24:01,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24597701149425288 [2025-02-08 08:24:01,306 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 185 flow. Second operand 10 states and 214 transitions. [2025-02-08 08:24:01,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 129 transitions, 771 flow [2025-02-08 08:24:01,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 129 transitions, 638 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-08 08:24:01,324 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 190 flow [2025-02-08 08:24:01,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=190, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2025-02-08 08:24:01,325 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -15 predicate places. [2025-02-08 08:24:01,325 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 190 flow [2025-02-08 08:24:01,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-02-08 08:24:01,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:01,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:01,332 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-02-08 08:24:01,526 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-02-08 08:24:01,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:24:01,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1858288237, now seen corresponding path program 2 times [2025-02-08 08:24:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:24:01,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039397885] [2025-02-08 08:24:01,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:24:01,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:01,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:01,529 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-02-08 08:24:01,529 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-02-08 08:24:01,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:24:01,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:24:01,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:24:01,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:01,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:24:01,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:24:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:01,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:24:01,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:24:01,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039397885] [2025-02-08 08:24:01,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039397885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:01,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:01,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:24:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722833297] [2025-02-08 08:24:01,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:01,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:24:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:24:01,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:24:01,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:24:01,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:24:01,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 190 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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-02-08 08:24:01,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:01,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:24:01,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:02,228 INFO L124 PetriNetUnfolderBase]: 2903/4500 cut-off events. [2025-02-08 08:24:02,228 INFO L125 PetriNetUnfolderBase]: For 1774/1774 co-relation queries the response was YES. [2025-02-08 08:24:02,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12045 conditions, 4500 events. 2903/4500 cut-off events. For 1774/1774 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 23377 event pairs, 511 based on Foata normal form. 16/4437 useless extension candidates. Maximal degree in co-relation 12026. Up to 1866 conditions per place. [2025-02-08 08:24:02,246 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 68 selfloop transitions, 9 changer transitions 27/110 dead transitions. [2025-02-08 08:24:02,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 110 transitions, 636 flow [2025-02-08 08:24:02,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:24:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:24:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-02-08 08:24:02,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25779967159277506 [2025-02-08 08:24:02,247 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 190 flow. Second operand 7 states and 157 transitions. [2025-02-08 08:24:02,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 110 transitions, 636 flow [2025-02-08 08:24:02,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 588 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-02-08 08:24:02,258 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 257 flow [2025-02-08 08:24:02,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2025-02-08 08:24:02,258 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2025-02-08 08:24:02,258 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 257 flow [2025-02-08 08:24:02,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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-02-08 08:24:02,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:02,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:02,266 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-02-08 08:24:02,459 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-02-08 08:24:02,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:24:02,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash 413500211, now seen corresponding path program 3 times [2025-02-08 08:24:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:24:02,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55544769] [2025-02-08 08:24:02,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:24:02,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:02,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:02,462 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:24:02,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 08:24:02,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:24:02,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:24:02,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:24:02,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:02,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:24:02,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:24:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:02,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:24:02,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:24:02,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55544769] [2025-02-08 08:24:02,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55544769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:02,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:02,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:24:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545993334] [2025-02-08 08:24:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:02,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:24:02,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:24:02,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:24:02,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:24:02,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:24:02,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 257 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:02,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:02,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:24:02,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:03,020 INFO L124 PetriNetUnfolderBase]: 1989/3145 cut-off events. [2025-02-08 08:24:03,020 INFO L125 PetriNetUnfolderBase]: For 1559/1572 co-relation queries the response was YES. [2025-02-08 08:24:03,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8522 conditions, 3145 events. 1989/3145 cut-off events. For 1559/1572 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15572 event pairs, 391 based on Foata normal form. 22/3129 useless extension candidates. Maximal degree in co-relation 8503. Up to 1324 conditions per place. [2025-02-08 08:24:03,029 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 54 selfloop transitions, 12 changer transitions 34/106 dead transitions. [2025-02-08 08:24:03,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 605 flow [2025-02-08 08:24:03,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:24:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:24:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2025-02-08 08:24:03,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24281609195402298 [2025-02-08 08:24:03,030 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 257 flow. Second operand 8 states and 169 transitions. [2025-02-08 08:24:03,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 605 flow [2025-02-08 08:24:03,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 583 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 08:24:03,033 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 228 flow [2025-02-08 08:24:03,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2025-02-08 08:24:03,034 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -12 predicate places. [2025-02-08 08:24:03,034 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 228 flow [2025-02-08 08:24:03,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:03,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:03,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:03,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 08:24:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:03,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:24:03,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:03,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1386909627, now seen corresponding path program 4 times [2025-02-08 08:24:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:24:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351487496] [2025-02-08 08:24:03,236 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:24:03,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:03,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:03,238 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:24:03,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 08:24:03,315 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 08:24:03,332 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 30 statements. [2025-02-08 08:24:03,332 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:24:03,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:03,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 08:24:03,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:24:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:03,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:24:03,396 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:24:03,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351487496] [2025-02-08 08:24:03,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351487496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:03,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:03,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:24:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347158054] [2025-02-08 08:24:03,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:03,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:24:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:24:03,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:24:03,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:24:03,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 87 [2025-02-08 08:24:03,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:03,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:03,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 87 [2025-02-08 08:24:03,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:03,661 INFO L124 PetriNetUnfolderBase]: 1043/1674 cut-off events. [2025-02-08 08:24:03,661 INFO L125 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2025-02-08 08:24:03,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4435 conditions, 1674 events. 1043/1674 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7122 event pairs, 255 based on Foata normal form. 8/1681 useless extension candidates. Maximal degree in co-relation 4414. Up to 918 conditions per place. [2025-02-08 08:24:03,667 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 44 selfloop transitions, 2 changer transitions 37/89 dead transitions. [2025-02-08 08:24:03,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 529 flow [2025-02-08 08:24:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:24:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:24:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-02-08 08:24:03,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22167487684729065 [2025-02-08 08:24:03,668 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 228 flow. Second operand 7 states and 135 transitions. [2025-02-08 08:24:03,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 529 flow [2025-02-08 08:24:03,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 458 flow, removed 13 selfloop flow, removed 12 redundant places. [2025-02-08 08:24:03,671 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 173 flow [2025-02-08 08:24:03,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2025-02-08 08:24:03,672 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -16 predicate places. [2025-02-08 08:24:03,672 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 173 flow [2025-02-08 08:24:03,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:03,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:03,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:03,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 08:24:03,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:03,873 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err4ASSERT_VIOLATIONMEMORY_LEAK, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2025-02-08 08:24:03,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -254173419, now seen corresponding path program 5 times [2025-02-08 08:24:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:24:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474073292] [2025-02-08 08:24:03,874 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:24:03,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:03,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:03,876 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:24:03,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 08:24:03,963 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:24:03,995 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:24:03,995 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:24:03,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:24:03,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:24:04,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:24:04,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:24:04,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:04,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:24:04,090 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:24:04,090 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:24:04,091 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2025-02-08 08:24:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONMEMORY_LEAK (67 of 69 remaining) [2025-02-08 08:24:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2025-02-08 08:24:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2025-02-08 08:24:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2025-02-08 08:24:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2025-02-08 08:24:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2025-02-08 08:24:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2025-02-08 08:24:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2025-02-08 08:24:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 69 remaining) [2025-02-08 08:24:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (32 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONMEMORY_LEAK (28 of 69 remaining) [2025-02-08 08:24:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 69 remaining) [2025-02-08 08:24:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 69 remaining) [2025-02-08 08:24:04,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 08:24:04,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:04,296 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:04,383 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:24:04,384 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:24:04,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:24:04 BasicIcfg [2025-02-08 08:24:04,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:24:04,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:24:04,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:24:04,393 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:24:04,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:23:34" (3/4) ... [2025-02-08 08:24:04,395 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:24:04,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:24:04,396 INFO L158 Benchmark]: Toolchain (without parser) took 31550.96ms. Allocated memory was 109.1MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 83.0MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-02-08 08:24:04,396 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:24:04,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.99ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 58.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:24:04,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.99ms. Allocated memory is still 109.1MB. Free memory was 58.4MB in the beginning and 55.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:24:04,397 INFO L158 Benchmark]: Boogie Preprocessor took 69.79ms. Allocated memory is still 109.1MB. Free memory was 55.9MB in the beginning and 52.3MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:24:04,398 INFO L158 Benchmark]: IcfgBuilder took 1271.49ms. Allocated memory was 109.1MB in the beginning and 151.0MB in the end (delta: 41.9MB). Free memory was 52.3MB in the beginning and 113.2MB in the end (delta: -60.9MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2025-02-08 08:24:04,398 INFO L158 Benchmark]: TraceAbstraction took 29766.45ms. Allocated memory was 151.0MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 112.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2025-02-08 08:24:04,398 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 6.3GB. Free memory was 3.7GB in the beginning and 3.7GB in the end (delta: 619.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:24:04,399 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.93ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.99ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 58.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.99ms. Allocated memory is still 109.1MB. Free memory was 58.4MB in the beginning and 55.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.79ms. Allocated memory is still 109.1MB. Free memory was 55.9MB in the beginning and 52.3MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1271.49ms. Allocated memory was 109.1MB in the beginning and 151.0MB in the end (delta: 41.9MB). Free memory was 52.3MB in the beginning and 113.2MB in the end (delta: -60.9MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29766.45ms. Allocated memory was 151.0MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 112.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 6.3GB. Free memory was 3.7GB in the beginning and 3.7GB in the end (delta: 619.3kB). Peak memory consumption was 8.4MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1853; [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852=-2, t1853=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1854; [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1852=-2, t1853=-1, t1854=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L760] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852=-2, t1853=-1, t1854=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852=-2, t1853=-1, t1854=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852=-2, t1853=-1, t1854=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L17] 0 __assert_fail ("0", "safe003_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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 7 procedures, 130 locations, 69 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: 29.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 752 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 739 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1961 IncrementalHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 0 mSDtfsCounter, 1961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=12, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 279 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 1113 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1884 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-02-08 08:24:04,424 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