./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe000_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/safe000_rmo.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 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:46:44,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:46:44,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:46:44,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:46:44,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:46:44,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:46:44,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:46:44,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:46:44,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:46:44,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:46:44,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:46:44,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:46:44,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:46:44,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:46:44,194 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:46:44,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:46:44,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:46:44,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:46:44,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:46:44,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:46:44,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:46:44,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:46:44,197 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 -> 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 [2025-02-06 12:46:44,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:46:44,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:46:44,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:46:44,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:46:44,476 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:46:44,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2025-02-06 12:46:45,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1ae2ca6a/5550357647074dafaadc5287544a4013/FLAG27e301241 [2025-02-06 12:46:46,169 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:46:46,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2025-02-06 12:46:46,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1ae2ca6a/5550357647074dafaadc5287544a4013/FLAG27e301241 [2025-02-06 12:46:46,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1ae2ca6a/5550357647074dafaadc5287544a4013 [2025-02-06 12:46:46,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:46:46,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:46:46,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:46:46,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:46:46,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:46:46,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645f46cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46, skipping insertion in model container [2025-02-06 12:46:46,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:46:46,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:46:46,638 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:46:46,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:46:46,772 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:46:46,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46 WrapperNode [2025-02-06 12:46:46,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:46:46,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:46:46,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:46:46,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:46:46,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,838 INFO L138 Inliner]: procedures = 175, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2025-02-06 12:46:46,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:46:46,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:46:46,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:46:46,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:46:46,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,898 INFO L175 MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2025-02-06 12:46:46,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:46:46,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:46:46,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:46:46,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:46:46,937 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (1/1) ... [2025-02-06 12:46:46,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:46:46,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:46,971 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-06 12:46:46,978 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-06 12:46:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:46:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:46:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:46:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:46:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:46:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:46:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:46:46,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:46:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:46:46,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:46:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:46:46,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:46:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:46:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:46:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:46:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:46:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:46:47,000 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:46:47,161 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:46:47,163 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:46:47,838 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:46:47,838 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:46:48,479 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:46:48,479 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:46:48,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:48 BoogieIcfgContainer [2025-02-06 12:46:48,481 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:46:48,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:46:48,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:46:48,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:46:48,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:46:46" (1/3) ... [2025-02-06 12:46:48,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459955fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:48, skipping insertion in model container [2025-02-06 12:46:48,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:46" (2/3) ... [2025-02-06 12:46:48,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459955fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:48, skipping insertion in model container [2025-02-06 12:46:48,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:48" (3/3) ... [2025-02-06 12:46:48,493 INFO L128 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2025-02-06 12:46:48,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:46:48,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe000_rmo.i that has 4 procedures, 96 locations, 1 initial locations, 0 loop locations, and 56 error locations. [2025-02-06 12:46:48,512 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:46:48,711 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:46:48,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 206 flow [2025-02-06 12:46:48,824 INFO L124 PetriNetUnfolderBase]: 2/94 cut-off events. [2025-02-06 12:46:48,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:48,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 413 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2025-02-06 12:46:48,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 206 flow [2025-02-06 12:46:48,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2025-02-06 12:46:48,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:46:48,860 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;@3966b3da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:46:48,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 95 error locations. [2025-02-06 12:46:48,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:46:48,866 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:46:48,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:48,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:48,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:46:48,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:46:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash 27315564, now seen corresponding path program 1 times [2025-02-06 12:46:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:48,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038774133] [2025-02-06 12:46:48,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:48,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:46:49,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:46:49,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:49,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:49,221 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-06 12:46:49,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:49,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038774133] [2025-02-06 12:46:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038774133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:49,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:49,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:46:49,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222346219] [2025-02-06 12:46:49,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:49,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:46:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:49,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:46:49,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:46:49,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:46:49,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:46:49,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:49,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:46:49,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:54,294 INFO L124 PetriNetUnfolderBase]: 24608/36733 cut-off events. [2025-02-06 12:46:54,294 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-02-06 12:46:54,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71079 conditions, 36733 events. 24608/36733 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 1687. Compared 264564 event pairs, 24608 based on Foata normal form. 1260/26495 useless extension candidates. Maximal degree in co-relation 71068. Up to 34199 conditions per place. [2025-02-06 12:46:54,550 INFO L140 encePairwiseOnDemand]: 53/97 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-06 12:46:54,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 195 flow [2025-02-06 12:46:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:46:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:46:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-02-06 12:46:54,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39862542955326463 [2025-02-06 12:46:54,564 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 197 flow. Second operand 3 states and 116 transitions. [2025-02-06 12:46:54,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 195 flow [2025-02-06 12:46:54,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:46:54,572 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 108 flow [2025-02-06 12:46:54,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=106, 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=108, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-02-06 12:46:54,583 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -43 predicate places. [2025-02-06 12:46:54,583 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 108 flow [2025-02-06 12:46:54,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:46:54,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:54,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:46:54,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:46:54,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:46:54,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash 27315565, now seen corresponding path program 1 times [2025-02-06 12:46:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387298509] [2025-02-06 12:46:54,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:54,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:46:54,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:46:54,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:54,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:54,795 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-06 12:46:54,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:54,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387298509] [2025-02-06 12:46:54,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387298509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:54,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:54,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:46:54,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337064865] [2025-02-06 12:46:54,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:54,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:46:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:54,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:46:54,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:46:54,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:46:54,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:46:54,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:54,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:46:54,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:55,978 INFO L124 PetriNetUnfolderBase]: 6395/9947 cut-off events. [2025-02-06 12:46:55,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:55,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19109 conditions, 9947 events. 6395/9947 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 61711 event pairs, 6395 based on Foata normal form. 0/9510 useless extension candidates. Maximal degree in co-relation 19103. Up to 9072 conditions per place. [2025-02-06 12:46:56,025 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 30 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-02-06 12:46:56,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 150 flow [2025-02-06 12:46:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:46:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:46:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-06 12:46:56,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2508591065292096 [2025-02-06 12:46:56,027 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 108 flow. Second operand 3 states and 73 transitions. [2025-02-06 12:46:56,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 150 flow [2025-02-06 12:46:56,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:46:56,028 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2025-02-06 12:46:56,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2025-02-06 12:46:56,029 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -53 predicate places. [2025-02-06 12:46:56,029 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2025-02-06 12:46:56,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:46:56,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:56,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:56,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:46:56,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:46:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1039653400, now seen corresponding path program 1 times [2025-02-06 12:46:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:56,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310095097] [2025-02-06 12:46:56,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:56,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:46:56,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:46:56,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:56,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310095097] [2025-02-06 12:46:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310095097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:56,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:56,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:46:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982885852] [2025-02-06 12:46:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:56,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:46:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:56,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:46:56,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:46:56,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:46:56,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 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-06 12:46:56,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:56,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:46:56,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:57,297 INFO L124 PetriNetUnfolderBase]: 5663/8200 cut-off events. [2025-02-06 12:46:57,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:57,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16343 conditions, 8200 events. 5663/8200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 46841 event pairs, 803 based on Foata normal form. 0/7839 useless extension candidates. Maximal degree in co-relation 16336. Up to 7199 conditions per place. [2025-02-06 12:46:57,333 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-02-06 12:46:57,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 239 flow [2025-02-06 12:46:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:46:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:46:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-02-06 12:46:57,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2920962199312715 [2025-02-06 12:46:57,335 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 85 transitions. [2025-02-06 12:46:57,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 239 flow [2025-02-06 12:46:57,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:46:57,338 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-02-06 12:46:57,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-06 12:46:57,339 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2025-02-06 12:46:57,339 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-02-06 12:46:57,339 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-06 12:46:57,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:57,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:57,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:46:57,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:46:57,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:57,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1620517819, now seen corresponding path program 1 times [2025-02-06 12:46:57,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:57,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419885143] [2025-02-06 12:46:57,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:57,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:57,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:46:57,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:46:57,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:57,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:57,590 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-06 12:46:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419885143] [2025-02-06 12:46:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419885143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:57,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:46:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149451256] [2025-02-06 12:46:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:57,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:46:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:57,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:46:57,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:46:57,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:46:57,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 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-06 12:46:57,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:57,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:46:57,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:58,789 INFO L124 PetriNetUnfolderBase]: 5219/7576 cut-off events. [2025-02-06 12:46:58,789 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-02-06 12:46:58,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15953 conditions, 7576 events. 5219/7576 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 43113 event pairs, 659 based on Foata normal form. 0/7575 useless extension candidates. Maximal degree in co-relation 15944. Up to 6574 conditions per place. [2025-02-06 12:46:58,868 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-02-06 12:46:58,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 242 flow [2025-02-06 12:46:58,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:46:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:46:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-06 12:46:58,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23969072164948454 [2025-02-06 12:46:58,870 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 93 transitions. [2025-02-06 12:46:58,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 242 flow [2025-02-06 12:46:58,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:46:58,875 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-02-06 12:46:58,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2025-02-06 12:46:58,876 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2025-02-06 12:46:58,876 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-02-06 12:46:58,877 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-06 12:46:58,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:58,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:46:58,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:46:58,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1620517820, now seen corresponding path program 1 times [2025-02-06 12:46:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180654554] [2025-02-06 12:46:58,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:58,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:46:58,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:46:58,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:58,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:59,298 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-06 12:46:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180654554] [2025-02-06 12:46:59,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180654554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:59,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:59,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:46:59,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429221990] [2025-02-06 12:46:59,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:59,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:46:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:59,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:46:59,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:46:59,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:46:59,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 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-06 12:46:59,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:59,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:46:59,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:00,501 INFO L124 PetriNetUnfolderBase]: 4775/6952 cut-off events. [2025-02-06 12:47:00,501 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-02-06 12:47:00,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14525 conditions, 6952 events. 4775/6952 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 39431 event pairs, 515 based on Foata normal form. 180/7131 useless extension candidates. Maximal degree in co-relation 14516. Up to 5950 conditions per place. [2025-02-06 12:47:00,527 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 49 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-02-06 12:47:00,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 236 flow [2025-02-06 12:47:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:47:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:47:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 12:47:00,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23711340206185566 [2025-02-06 12:47:00,529 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 92 transitions. [2025-02-06 12:47:00,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 236 flow [2025-02-06 12:47:00,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:47:00,530 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-02-06 12:47:00,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-02-06 12:47:00,531 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -53 predicate places. [2025-02-06 12:47:00,531 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-02-06 12:47:00,531 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-06 12:47:00,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:00,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:00,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:47:00,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:00,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:00,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1777107707, now seen corresponding path program 1 times [2025-02-06 12:47:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431550814] [2025-02-06 12:47:00,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:00,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:47:00,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:47:00,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:00,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:00,599 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-06 12:47:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:00,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431550814] [2025-02-06 12:47:00,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431550814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:00,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:00,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:00,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573582094] [2025-02-06 12:47:00,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:00,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:00,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:00,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:00,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:00,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:00,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 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-06 12:47:00,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:00,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:00,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:01,308 INFO L124 PetriNetUnfolderBase]: 4775/7463 cut-off events. [2025-02-06 12:47:01,309 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-02-06 12:47:01,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15035 conditions, 7463 events. 4775/7463 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44199 event pairs, 4775 based on Foata normal form. 216/7674 useless extension candidates. Maximal degree in co-relation 15027. Up to 6804 conditions per place. [2025-02-06 12:47:01,339 INFO L140 encePairwiseOnDemand]: 95/97 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 12:47:01,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 141 flow [2025-02-06 12:47:01,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:47:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:47:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 12:47:01,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1958762886597938 [2025-02-06 12:47:01,340 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 57 transitions. [2025-02-06 12:47:01,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 141 flow [2025-02-06 12:47:01,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:01,342 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-02-06 12:47:01,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-02-06 12:47:01,343 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -54 predicate places. [2025-02-06 12:47:01,343 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-02-06 12:47:01,343 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-06 12:47:01,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:01,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:01,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:47:01,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:01,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1777105283, now seen corresponding path program 1 times [2025-02-06 12:47:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324435450] [2025-02-06 12:47:01,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:01,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:01,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:47:01,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:47:01,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:01,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:01,697 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-06 12:47:01,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:01,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324435450] [2025-02-06 12:47:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324435450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:01,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:47:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825773946] [2025-02-06 12:47:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:47:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:01,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:47:01,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:47:01,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:01,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 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-06 12:47:01,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:01,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:01,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:02,745 INFO L124 PetriNetUnfolderBase]: 5831/8731 cut-off events. [2025-02-06 12:47:02,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18031 conditions, 8731 events. 5831/8731 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 50591 event pairs, 717 based on Foata normal form. 0/8547 useless extension candidates. Maximal degree in co-relation 18023. Up to 5163 conditions per place. [2025-02-06 12:47:02,765 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 42 selfloop transitions, 2 changer transitions 70/119 dead transitions. [2025-02-06 12:47:02,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 119 transitions, 492 flow [2025-02-06 12:47:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-02-06 12:47:02,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2422680412371134 [2025-02-06 12:47:02,767 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 8 states and 188 transitions. [2025-02-06 12:47:02,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 119 transitions, 492 flow [2025-02-06 12:47:02,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 119 transitions, 491 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:47:02,769 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 93 flow [2025-02-06 12:47:02,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-02-06 12:47:02,769 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -44 predicate places. [2025-02-06 12:47:02,770 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 93 flow [2025-02-06 12:47:02,770 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-06 12:47:02,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:02,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:02,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:47:02,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:02,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash -119103204, now seen corresponding path program 1 times [2025-02-06 12:47:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:02,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638589286] [2025-02-06 12:47:02,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:02,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:47:02,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:47:02,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:02,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:03,009 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-06 12:47:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638589286] [2025-02-06 12:47:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638589286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:47:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219356263] [2025-02-06 12:47:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:03,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:03,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:03,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:03,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 93 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-06 12:47:03,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:03,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:03,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:03,980 INFO L124 PetriNetUnfolderBase]: 5733/8505 cut-off events. [2025-02-06 12:47:03,980 INFO L125 PetriNetUnfolderBase]: For 1036/1036 co-relation queries the response was YES. [2025-02-06 12:47:03,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18933 conditions, 8505 events. 5733/8505 cut-off events. For 1036/1036 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 48312 event pairs, 1031 based on Foata normal form. 180/8683 useless extension candidates. Maximal degree in co-relation 18919. Up to 3359 conditions per place. [2025-02-06 12:47:04,010 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 52 selfloop transitions, 3 changer transitions 59/119 dead transitions. [2025-02-06 12:47:04,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 119 transitions, 518 flow [2025-02-06 12:47:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-02-06 12:47:04,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2422680412371134 [2025-02-06 12:47:04,013 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 93 flow. Second operand 8 states and 188 transitions. [2025-02-06 12:47:04,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 119 transitions, 518 flow [2025-02-06 12:47:04,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 119 transitions, 496 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 12:47:04,073 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 103 flow [2025-02-06 12:47:04,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=103, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2025-02-06 12:47:04,074 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -43 predicate places. [2025-02-06 12:47:04,074 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 103 flow [2025-02-06 12:47:04,074 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-06 12:47:04,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:04,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:04,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:47:04,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:04,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash 683444181, now seen corresponding path program 1 times [2025-02-06 12:47:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:04,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964156497] [2025-02-06 12:47:04,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:04,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:47:04,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:47:04,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:04,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:04,373 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-06 12:47:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964156497] [2025-02-06 12:47:04,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964156497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:04,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:04,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:47:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314630741] [2025-02-06 12:47:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:04,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:47:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:04,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:47:04,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:47:04,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:04,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 103 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-06 12:47:04,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:04,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:04,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:04,994 INFO L124 PetriNetUnfolderBase]: 2962/4554 cut-off events. [2025-02-06 12:47:04,994 INFO L125 PetriNetUnfolderBase]: For 1564/1566 co-relation queries the response was YES. [2025-02-06 12:47:05,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10501 conditions, 4554 events. 2962/4554 cut-off events. For 1564/1566 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 23205 event pairs, 505 based on Foata normal form. 120/4673 useless extension candidates. Maximal degree in co-relation 10485. Up to 3176 conditions per place. [2025-02-06 12:47:05,010 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 40 selfloop transitions, 2 changer transitions 41/88 dead transitions. [2025-02-06 12:47:05,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 403 flow [2025-02-06 12:47:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:47:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:47:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2025-02-06 12:47:05,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21796759941089838 [2025-02-06 12:47:05,012 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 103 flow. Second operand 7 states and 148 transitions. [2025-02-06 12:47:05,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 403 flow [2025-02-06 12:47:05,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 366 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-02-06 12:47:05,024 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 99 flow [2025-02-06 12:47:05,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=99, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-02-06 12:47:05,025 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -44 predicate places. [2025-02-06 12:47:05,025 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 99 flow [2025-02-06 12:47:05,025 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-06 12:47:05,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:05,025 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-06 12:47:05,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:47:05,025 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:05,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:05,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1536014190, now seen corresponding path program 1 times [2025-02-06 12:47:05,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:05,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785162007] [2025-02-06 12:47:05,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:05,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:05,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:47:05,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:47:05,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:05,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:05,986 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-06 12:47:05,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:05,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785162007] [2025-02-06 12:47:05,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785162007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:05,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:05,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:47:05,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123444618] [2025-02-06 12:47:05,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:05,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:05,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:05,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:05,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:05,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:05,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-06 12:47:05,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:05,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:05,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:06,692 INFO L124 PetriNetUnfolderBase]: 3554/5400 cut-off events. [2025-02-06 12:47:06,692 INFO L125 PetriNetUnfolderBase]: For 1376/1376 co-relation queries the response was YES. [2025-02-06 12:47:06,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12189 conditions, 5400 events. 3554/5400 cut-off events. For 1376/1376 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 27824 event pairs, 1684 based on Foata normal form. 120/5520 useless extension candidates. Maximal degree in co-relation 12174. Up to 3583 conditions per place. [2025-02-06 12:47:06,712 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 45 selfloop transitions, 8 changer transitions 41/99 dead transitions. [2025-02-06 12:47:06,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 99 transitions, 451 flow [2025-02-06 12:47:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2025-02-06 12:47:06,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21649484536082475 [2025-02-06 12:47:06,714 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 99 flow. Second operand 8 states and 168 transitions. [2025-02-06 12:47:06,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 99 transitions, 451 flow [2025-02-06 12:47:06,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 421 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-02-06 12:47:06,731 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 175 flow [2025-02-06 12:47:06,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2025-02-06 12:47:06,731 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -41 predicate places. [2025-02-06 12:47:06,731 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 175 flow [2025-02-06 12:47:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-06 12:47:06,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:06,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:06,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:47:06,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:06,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1583896506, now seen corresponding path program 2 times [2025-02-06 12:47:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:06,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310670118] [2025-02-06 12:47:06,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:47:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:06,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:47:06,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:47:06,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:47:06,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:07,209 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-06 12:47:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:07,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310670118] [2025-02-06 12:47:07,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310670118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:07,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:07,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:47:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123044304] [2025-02-06 12:47:07,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:07,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:07,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:07,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:07,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:07,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-06 12:47:07,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:07,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:07,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:07,981 INFO L124 PetriNetUnfolderBase]: 4179/6269 cut-off events. [2025-02-06 12:47:07,981 INFO L125 PetriNetUnfolderBase]: For 4773/4775 co-relation queries the response was YES. [2025-02-06 12:47:07,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18199 conditions, 6269 events. 4179/6269 cut-off events. For 4773/4775 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 32200 event pairs, 566 based on Foata normal form. 120/6388 useless extension candidates. Maximal degree in co-relation 18182. Up to 2580 conditions per place. [2025-02-06 12:47:08,010 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 51 selfloop transitions, 4 changer transitions 57/117 dead transitions. [2025-02-06 12:47:08,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 730 flow [2025-02-06 12:47:08,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-02-06 12:47:08,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21520618556701032 [2025-02-06 12:47:08,011 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 175 flow. Second operand 8 states and 167 transitions. [2025-02-06 12:47:08,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 730 flow [2025-02-06 12:47:08,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 117 transitions, 719 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:08,030 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 189 flow [2025-02-06 12:47:08,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=8, PETRI_FLOW=189, PETRI_PLACES=68, PETRI_TRANSITIONS=38} [2025-02-06 12:47:08,031 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -34 predicate places. [2025-02-06 12:47:08,031 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 189 flow [2025-02-06 12:47:08,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-06 12:47:08,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:08,031 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-06 12:47:08,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:47:08,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:08,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:08,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2010447926, now seen corresponding path program 1 times [2025-02-06 12:47:08,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:08,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535912241] [2025-02-06 12:47:08,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:08,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:08,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:47:08,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:47:08,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:08,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:09,243 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-06 12:47:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535912241] [2025-02-06 12:47:09,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535912241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:09,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:09,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:47:09,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805298845] [2025-02-06 12:47:09,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:09,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:47:09,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:09,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:47:09,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:47:09,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:09,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 38 transitions, 189 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-06 12:47:09,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:09,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:09,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:09,923 INFO L124 PetriNetUnfolderBase]: 2172/3394 cut-off events. [2025-02-06 12:47:09,923 INFO L125 PetriNetUnfolderBase]: For 5537/5539 co-relation queries the response was YES. [2025-02-06 12:47:09,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10803 conditions, 3394 events. 2172/3394 cut-off events. For 5537/5539 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 16160 event pairs, 244 based on Foata normal form. 80/3474 useless extension candidates. Maximal degree in co-relation 10787. Up to 1512 conditions per place. [2025-02-06 12:47:09,945 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 63 selfloop transitions, 12 changer transitions 22/102 dead transitions. [2025-02-06 12:47:09,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 102 transitions, 649 flow [2025-02-06 12:47:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2025-02-06 12:47:09,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.211340206185567 [2025-02-06 12:47:09,948 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 189 flow. Second operand 8 states and 164 transitions. [2025-02-06 12:47:09,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 102 transitions, 649 flow [2025-02-06 12:47:09,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 597 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:47:09,970 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 249 flow [2025-02-06 12:47:09,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=249, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2025-02-06 12:47:09,971 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -35 predicate places. [2025-02-06 12:47:09,972 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 249 flow [2025-02-06 12:47:09,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-06 12:47:09,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:09,972 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-06 12:47:09,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:47:09,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:09,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1212471707, now seen corresponding path program 1 times [2025-02-06 12:47:09,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51099442] [2025-02-06 12:47:09,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:09,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:47:10,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:47:10,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:10,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:10,963 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-06 12:47:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51099442] [2025-02-06 12:47:10,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51099442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:10,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:10,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:47:10,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199303773] [2025-02-06 12:47:10,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:10,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:47:10,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:10,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:47:10,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:47:10,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:10,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 249 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-06 12:47:10,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:10,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:10,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:11,571 INFO L124 PetriNetUnfolderBase]: 2120/3322 cut-off events. [2025-02-06 12:47:11,571 INFO L125 PetriNetUnfolderBase]: For 5679/5679 co-relation queries the response was YES. [2025-02-06 12:47:11,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10545 conditions, 3322 events. 2120/3322 cut-off events. For 5679/5679 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 15907 event pairs, 725 based on Foata normal form. 60/3382 useless extension candidates. Maximal degree in co-relation 10531. Up to 2159 conditions per place. [2025-02-06 12:47:11,592 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 52 selfloop transitions, 13 changer transitions 20/90 dead transitions. [2025-02-06 12:47:11,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 90 transitions, 590 flow [2025-02-06 12:47:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:47:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:47:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2025-02-06 12:47:11,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20765832106038293 [2025-02-06 12:47:11,594 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 249 flow. Second operand 7 states and 141 transitions. [2025-02-06 12:47:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 90 transitions, 590 flow [2025-02-06 12:47:11,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 563 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-02-06 12:47:11,610 INFO L231 Difference]: Finished difference. Result has 70 places, 48 transitions, 308 flow [2025-02-06 12:47:11,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=70, PETRI_TRANSITIONS=48} [2025-02-06 12:47:11,611 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -32 predicate places. [2025-02-06 12:47:11,611 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 48 transitions, 308 flow [2025-02-06 12:47:11,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-06 12:47:11,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:11,611 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-06 12:47:11,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:47:11,612 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:11,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1923242912, now seen corresponding path program 1 times [2025-02-06 12:47:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:11,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219047523] [2025-02-06 12:47:11,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:11,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:11,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:47:11,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:47:11,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:11,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:11,848 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-06 12:47:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219047523] [2025-02-06 12:47:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219047523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:11,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:11,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:47:11,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328534144] [2025-02-06 12:47:11,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:11,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:47:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:11,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:47:11,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:47:11,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:11,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 48 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-06 12:47:11,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:11,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:11,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:12,201 INFO L124 PetriNetUnfolderBase]: 1763/2827 cut-off events. [2025-02-06 12:47:12,201 INFO L125 PetriNetUnfolderBase]: For 7288/7290 co-relation queries the response was YES. [2025-02-06 12:47:12,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9382 conditions, 2827 events. 1763/2827 cut-off events. For 7288/7290 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 14011 event pairs, 200 based on Foata normal form. 118/2945 useless extension candidates. Maximal degree in co-relation 9367. Up to 1584 conditions per place. [2025-02-06 12:47:12,221 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 73 selfloop transitions, 5 changer transitions 1/84 dead transitions. [2025-02-06 12:47:12,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 712 flow [2025-02-06 12:47:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:47:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:47:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-02-06 12:47:12,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2551546391752577 [2025-02-06 12:47:12,222 INFO L175 Difference]: Start difference. First operand has 70 places, 48 transitions, 308 flow. Second operand 4 states and 99 transitions. [2025-02-06 12:47:12,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 712 flow [2025-02-06 12:47:12,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 675 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-02-06 12:47:12,235 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 317 flow [2025-02-06 12:47:12,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=317, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2025-02-06 12:47:12,236 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -33 predicate places. [2025-02-06 12:47:12,236 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 317 flow [2025-02-06 12:47:12,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-06 12:47:12,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:12,236 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-06 12:47:12,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:47:12,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:12,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1580224813, now seen corresponding path program 1 times [2025-02-06 12:47:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:12,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124444338] [2025-02-06 12:47:12,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:12,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:47:12,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:47:12,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:12,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:13,599 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-06 12:47:13,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:13,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124444338] [2025-02-06 12:47:13,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124444338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:13,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:47:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078521068] [2025-02-06 12:47:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:13,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:47:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:13,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:47:13,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:47:13,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:13,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 317 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-06 12:47:13,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:13,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:13,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:14,221 INFO L124 PetriNetUnfolderBase]: 1689/2681 cut-off events. [2025-02-06 12:47:14,221 INFO L125 PetriNetUnfolderBase]: For 4601/4601 co-relation queries the response was YES. [2025-02-06 12:47:14,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9266 conditions, 2681 events. 1689/2681 cut-off events. For 4601/4601 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12367 event pairs, 74 based on Foata normal form. 50/2731 useless extension candidates. Maximal degree in co-relation 9251. Up to 1020 conditions per place. [2025-02-06 12:47:14,239 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 80 selfloop transitions, 16 changer transitions 20/121 dead transitions. [2025-02-06 12:47:14,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 121 transitions, 844 flow [2025-02-06 12:47:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:47:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:47:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2025-02-06 12:47:14,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2 [2025-02-06 12:47:14,241 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 317 flow. Second operand 10 states and 194 transitions. [2025-02-06 12:47:14,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 121 transitions, 844 flow [2025-02-06 12:47:14,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 808 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:14,251 INFO L231 Difference]: Finished difference. Result has 78 places, 50 transitions, 343 flow [2025-02-06 12:47:14,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=343, PETRI_PLACES=78, PETRI_TRANSITIONS=50} [2025-02-06 12:47:14,252 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -24 predicate places. [2025-02-06 12:47:14,252 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 50 transitions, 343 flow [2025-02-06 12:47:14,252 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-06 12:47:14,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:14,253 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-06 12:47:14,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:47:14,253 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1520693521, now seen corresponding path program 1 times [2025-02-06 12:47:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070737084] [2025-02-06 12:47:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:14,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:47:14,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:47:14,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:14,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:14,490 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-06 12:47:14,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:14,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070737084] [2025-02-06 12:47:14,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070737084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:14,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:14,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:47:14,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213381765] [2025-02-06 12:47:14,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:14,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:47:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:14,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:47:14,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:47:14,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:14,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 50 transitions, 343 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-06 12:47:14,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:14,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:14,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:14,818 INFO L124 PetriNetUnfolderBase]: 1108/1806 cut-off events. [2025-02-06 12:47:14,818 INFO L125 PetriNetUnfolderBase]: For 4943/4945 co-relation queries the response was YES. [2025-02-06 12:47:14,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6202 conditions, 1806 events. 1108/1806 cut-off events. For 4943/4945 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7981 event pairs, 110 based on Foata normal form. 94/1900 useless extension candidates. Maximal degree in co-relation 6186. Up to 669 conditions per place. [2025-02-06 12:47:14,828 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 76 selfloop transitions, 8 changer transitions 1/90 dead transitions. [2025-02-06 12:47:14,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 90 transitions, 775 flow [2025-02-06 12:47:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:47:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:47:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-02-06 12:47:14,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24948453608247423 [2025-02-06 12:47:14,830 INFO L175 Difference]: Start difference. First operand has 78 places, 50 transitions, 343 flow. Second operand 5 states and 121 transitions. [2025-02-06 12:47:14,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 90 transitions, 775 flow [2025-02-06 12:47:14,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 676 flow, removed 17 selfloop flow, removed 11 redundant places. [2025-02-06 12:47:14,837 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 297 flow [2025-02-06 12:47:14,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-02-06 12:47:14,839 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -31 predicate places. [2025-02-06 12:47:14,839 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 297 flow [2025-02-06 12:47:14,839 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-06 12:47:14,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:14,839 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-06 12:47:14,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:47:14,840 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:14,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1256931184, now seen corresponding path program 1 times [2025-02-06 12:47:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:14,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308486922] [2025-02-06 12:47:14,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:14,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 12:47:14,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 12:47:14,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:14,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:15,090 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-06 12:47:15,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:15,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308486922] [2025-02-06 12:47:15,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308486922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:15,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:15,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:47:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670789516] [2025-02-06 12:47:15,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:15,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:15,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:15,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:15,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:15,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:15,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 297 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-06 12:47:15,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:15,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:15,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:15,344 INFO L124 PetriNetUnfolderBase]: 659/1075 cut-off events. [2025-02-06 12:47:15,344 INFO L125 PetriNetUnfolderBase]: For 2630/2632 co-relation queries the response was YES. [2025-02-06 12:47:15,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3747 conditions, 1075 events. 659/1075 cut-off events. For 2630/2632 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4110 event pairs, 91 based on Foata normal form. 44/1119 useless extension candidates. Maximal degree in co-relation 3735. Up to 348 conditions per place. [2025-02-06 12:47:15,351 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 62 selfloop transitions, 11 changer transitions 1/79 dead transitions. [2025-02-06 12:47:15,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 79 transitions, 583 flow [2025-02-06 12:47:15,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:47:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:47:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-02-06 12:47:15,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.218213058419244 [2025-02-06 12:47:15,353 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 297 flow. Second operand 6 states and 127 transitions. [2025-02-06 12:47:15,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 79 transitions, 583 flow [2025-02-06 12:47:15,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 450 flow, removed 18 selfloop flow, removed 12 redundant places. [2025-02-06 12:47:15,359 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 208 flow [2025-02-06 12:47:15,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-02-06 12:47:15,360 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -36 predicate places. [2025-02-06 12:47:15,360 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 208 flow [2025-02-06 12:47:15,360 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-06 12:47:15,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:15,361 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-06 12:47:15,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:47:15,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:15,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:15,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1115866945, now seen corresponding path program 1 times [2025-02-06 12:47:15,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:15,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805158995] [2025-02-06 12:47:15,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:15,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:15,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:15,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:15,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:15,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:47:15,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:47:15,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:15,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:15,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:15,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:47:15,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:47:15,649 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:47:15,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (94 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 95 remaining) [2025-02-06 12:47:15,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 95 remaining) [2025-02-06 12:47:15,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 95 remaining) [2025-02-06 12:47:15,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 95 remaining) [2025-02-06 12:47:15,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (39 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 95 remaining) [2025-02-06 12:47:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 95 remaining) [2025-02-06 12:47:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 95 remaining) [2025-02-06 12:47:15,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 95 remaining) [2025-02-06 12:47:15,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 95 remaining) [2025-02-06 12:47:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 95 remaining) [2025-02-06 12:47:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 95 remaining) [2025-02-06 12:47:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 95 remaining) [2025-02-06 12:47:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 95 remaining) [2025-02-06 12:47:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 95 remaining) [2025-02-06 12:47:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 95 remaining) [2025-02-06 12:47:15,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:47:15,661 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:15,768 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:47:15,768 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:47:15,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:47:15 BasicIcfg [2025-02-06 12:47:15,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:47:15,774 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:47:15,774 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:47:15,774 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:47:15,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:48" (3/4) ... [2025-02-06 12:47:15,777 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:47:15,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:47:15,780 INFO L158 Benchmark]: Toolchain (without parser) took 29566.59ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 121.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 753.4MB. Max. memory is 16.1GB. [2025-02-06 12:47:15,780 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:15,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.84ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 95.7MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:47:15,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.01ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 93.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:15,782 INFO L158 Benchmark]: Boogie Preprocessor took 91.77ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 89.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:47:15,782 INFO L158 Benchmark]: IcfgBuilder took 1545.30ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 85.0MB in the end (delta: 4.0MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. [2025-02-06 12:47:15,782 INFO L158 Benchmark]: TraceAbstraction took 27289.19ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 84.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 706.9MB. Max. memory is 16.1GB. [2025-02-06 12:47:15,782 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 2.6GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 232.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:47:15,784 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.41ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.84ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 95.7MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.01ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 93.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 91.77ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 89.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1545.30ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 85.0MB in the end (delta: 4.0MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27289.19ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 84.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 706.9MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 2.6GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 232.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1789=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1790; [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789=-1, t1790=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1791; [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789=-1, t1790=0, t1791=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789=-1, t1790=0, t1791=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789=-1, t1790=0, t1791=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] EXPR 0 \read(y) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789=-1, t1790=0, t1791=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe000_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: 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, 156 locations, 95 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: 26.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1061 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1053 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2398 IncrementalHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 3 mSDtfsCounter, 2398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=15, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 1972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-06 12:47:15,802 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/safe000_rmo.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 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:47:18,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:47:18,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:47:18,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:47:18,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:47:18,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:47:18,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:47:18,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:47:18,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:47:18,441 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:47:18,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:47:18,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:47:18,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:47:18,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:47:18,443 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:47:18,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:47:18,444 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:47:18,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:47:18,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:47:18,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:47:18,444 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:47:18,444 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:47:18,444 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:47:18,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:47:18,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:47:18,445 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:47:18,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:47:18,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:47:18,445 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:47:18,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:47:18,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:47:18,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:47:18,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:47:18,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:47:18,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:47:18,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:47:18,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:47:18,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:47:18,447 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:47:18,447 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:47:18,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:47:18,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:47:18,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:47:18,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:47:18,447 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 -> 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 [2025-02-06 12:47:18,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:47:18,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:47:18,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:47:18,773 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:47:18,773 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:47:18,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2025-02-06 12:47:20,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f35d3788/188a8bb777124ab2a8a9d44d01144ad7/FLAGfca9d476c [2025-02-06 12:47:20,386 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:47:20,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2025-02-06 12:47:20,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f35d3788/188a8bb777124ab2a8a9d44d01144ad7/FLAGfca9d476c [2025-02-06 12:47:20,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f35d3788/188a8bb777124ab2a8a9d44d01144ad7 [2025-02-06 12:47:20,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:47:20,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:47:20,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:47:20,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:47:20,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:47:20,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:20,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e5054d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20, skipping insertion in model container [2025-02-06 12:47:20,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:20,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:47:20,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:47:20,817 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:47:20,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:47:20,924 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:47:20,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20 WrapperNode [2025-02-06 12:47:20,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:47:20,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:47:20,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:47:20,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:47:20,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:20,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:20,992 INFO L138 Inliner]: procedures = 179, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2025-02-06 12:47:20,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:47:20,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:47:20,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:47:20,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:47:21,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,043 INFO L175 MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2025-02-06 12:47:21,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:47:21,087 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:47:21,087 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:47:21,087 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:47:21,088 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (1/1) ... [2025-02-06 12:47:21,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:47:21,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:21,124 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-06 12:47:21,126 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-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:47:21,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:47:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:47:21,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:47:21,148 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:47:21,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:47:21,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:47:21,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:47:21,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:47:21,149 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:47:21,296 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:47:21,297 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:47:21,989 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:47:21,989 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:47:22,623 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:47:22,625 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:47:22,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:22 BoogieIcfgContainer [2025-02-06 12:47:22,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:47:22,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:47:22,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:47:22,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:47:22,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:47:20" (1/3) ... [2025-02-06 12:47:22,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d33c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:47:22, skipping insertion in model container [2025-02-06 12:47:22,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:20" (2/3) ... [2025-02-06 12:47:22,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d33c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:47:22, skipping insertion in model container [2025-02-06 12:47:22,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:22" (3/3) ... [2025-02-06 12:47:22,633 INFO L128 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2025-02-06 12:47:22,647 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:47:22,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe000_rmo.i that has 4 procedures, 96 locations, 1 initial locations, 0 loop locations, and 56 error locations. [2025-02-06 12:47:22,651 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:47:22,831 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:47:22,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 206 flow [2025-02-06 12:47:22,951 INFO L124 PetriNetUnfolderBase]: 2/94 cut-off events. [2025-02-06 12:47:22,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 413 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2025-02-06 12:47:22,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 206 flow [2025-02-06 12:47:22,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2025-02-06 12:47:22,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:47:22,980 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;@766b87d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:47:22,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 95 error locations. [2025-02-06 12:47:22,985 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:47:22,985 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:47:22,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:22,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:22,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:47:22,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash 27377132, now seen corresponding path program 1 times [2025-02-06 12:47:23,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:23,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126961758] [2025-02-06 12:47:23,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:23,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:23,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:23,006 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-06 12:47:23,008 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-06 12:47:23,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:47:23,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:47:23,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:23,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:23,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:47:23,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:23,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-06 12:47:23,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:23,241 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126961758] [2025-02-06 12:47:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126961758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:23,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:23,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:23,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632006302] [2025-02-06 12:47:23,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:23,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:23,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:23,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:23,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:23,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:47:23,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:23,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:23,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:28,608 INFO L124 PetriNetUnfolderBase]: 24608/36733 cut-off events. [2025-02-06 12:47:28,609 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-02-06 12:47:28,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71079 conditions, 36733 events. 24608/36733 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 1687. Compared 264564 event pairs, 24608 based on Foata normal form. 1260/26495 useless extension candidates. Maximal degree in co-relation 71068. Up to 34199 conditions per place. [2025-02-06 12:47:28,874 INFO L140 encePairwiseOnDemand]: 53/97 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-06 12:47:28,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 195 flow [2025-02-06 12:47:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:47:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:47:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-02-06 12:47:28,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39862542955326463 [2025-02-06 12:47:28,890 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 197 flow. Second operand 3 states and 116 transitions. [2025-02-06 12:47:28,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 195 flow [2025-02-06 12:47:28,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:47:28,901 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 108 flow [2025-02-06 12:47:28,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=106, 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=108, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-02-06 12:47:28,907 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -43 predicate places. [2025-02-06 12:47:28,909 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 108 flow [2025-02-06 12:47:28,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:47:28,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:28,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:47:28,919 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-06 12:47:29,113 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-06 12:47:29,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:29,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 27377133, now seen corresponding path program 1 times [2025-02-06 12:47:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1276503374] [2025-02-06 12:47:29,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:29,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:29,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:29,120 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-06 12:47:29,123 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-06 12:47:29,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:47:29,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:47:29,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:29,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:47:29,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:29,344 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-06 12:47:29,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:29,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:29,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276503374] [2025-02-06 12:47:29,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276503374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:29,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:29,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:29,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42923545] [2025-02-06 12:47:29,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:29,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:29,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:29,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:29,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:29,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:47:29,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:29,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:29,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:30,973 INFO L124 PetriNetUnfolderBase]: 6395/9947 cut-off events. [2025-02-06 12:47:30,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:31,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19109 conditions, 9947 events. 6395/9947 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 61711 event pairs, 6395 based on Foata normal form. 0/9510 useless extension candidates. Maximal degree in co-relation 19103. Up to 9072 conditions per place. [2025-02-06 12:47:31,056 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 30 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-02-06 12:47:31,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 150 flow [2025-02-06 12:47:31,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:47:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:47:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-06 12:47:31,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2508591065292096 [2025-02-06 12:47:31,059 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 108 flow. Second operand 3 states and 73 transitions. [2025-02-06 12:47:31,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 150 flow [2025-02-06 12:47:31,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:47:31,060 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2025-02-06 12:47:31,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2025-02-06 12:47:31,061 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -53 predicate places. [2025-02-06 12:47:31,061 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2025-02-06 12:47:31,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:47:31,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:31,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:31,073 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-06 12:47:31,265 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-06 12:47:31,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:31,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash 973270186, now seen corresponding path program 1 times [2025-02-06 12:47:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509008222] [2025-02-06 12:47:31,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:31,271 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-06 12:47:31,273 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-06 12:47:31,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:47:31,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:47:31,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:31,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:31,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:47:31,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:31,458 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-06 12:47:31,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:31,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509008222] [2025-02-06 12:47:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509008222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:31,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898481243] [2025-02-06 12:47:31,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:31,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:31,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:31,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:31,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:31,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:31,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 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-06 12:47:31,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:31,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:31,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:32,350 INFO L124 PetriNetUnfolderBase]: 5663/8200 cut-off events. [2025-02-06 12:47:32,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:32,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16343 conditions, 8200 events. 5663/8200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 46841 event pairs, 803 based on Foata normal form. 0/7839 useless extension candidates. Maximal degree in co-relation 16336. Up to 7199 conditions per place. [2025-02-06 12:47:32,390 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-02-06 12:47:32,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 239 flow [2025-02-06 12:47:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:47:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:47:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-02-06 12:47:32,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2920962199312715 [2025-02-06 12:47:32,392 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 85 transitions. [2025-02-06 12:47:32,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 239 flow [2025-02-06 12:47:32,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:47:32,393 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-02-06 12:47:32,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-06 12:47:32,394 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2025-02-06 12:47:32,394 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-02-06 12:47:32,394 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-06 12:47:32,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:32,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:32,404 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-06 12:47:32,595 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-06 12:47:32,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:32,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash -990166467, now seen corresponding path program 1 times [2025-02-06 12:47:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:32,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139770118] [2025-02-06 12:47:32,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:32,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:32,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:32,600 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-06 12:47:32,602 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-06 12:47:32,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:47:32,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:47:32,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:32,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:32,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:47:32,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:32,842 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-06 12:47:32,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:32,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139770118] [2025-02-06 12:47:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139770118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:32,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:32,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:47:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495096026] [2025-02-06 12:47:32,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:32,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:47:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:32,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:47:32,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:47:32,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:32,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 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-06 12:47:32,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:32,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:32,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:33,700 INFO L124 PetriNetUnfolderBase]: 5219/7576 cut-off events. [2025-02-06 12:47:33,700 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-02-06 12:47:33,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15953 conditions, 7576 events. 5219/7576 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 43003 event pairs, 659 based on Foata normal form. 0/7575 useless extension candidates. Maximal degree in co-relation 15944. Up to 6574 conditions per place. [2025-02-06 12:47:33,728 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-02-06 12:47:33,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 242 flow [2025-02-06 12:47:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:47:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:47:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-06 12:47:33,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23969072164948454 [2025-02-06 12:47:33,730 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 93 transitions. [2025-02-06 12:47:33,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 242 flow [2025-02-06 12:47:33,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:33,735 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-02-06 12:47:33,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2025-02-06 12:47:33,736 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2025-02-06 12:47:33,736 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-02-06 12:47:33,736 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-06 12:47:33,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:33,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:33,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:47:33,937 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-06 12:47:33,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:33,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash -990166466, now seen corresponding path program 1 times [2025-02-06 12:47:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707888691] [2025-02-06 12:47:33,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:33,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:33,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:33,941 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-06 12:47:33,942 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-06 12:47:34,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:47:34,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:47:34,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:34,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:34,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:47:34,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:34,214 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-06 12:47:34,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:34,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:34,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707888691] [2025-02-06 12:47:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707888691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:34,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:34,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:47:34,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998728615] [2025-02-06 12:47:34,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:34,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:47:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:34,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:47:34,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:47:34,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:34,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 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-06 12:47:34,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:34,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:34,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:34,966 INFO L124 PetriNetUnfolderBase]: 4775/6952 cut-off events. [2025-02-06 12:47:34,967 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-02-06 12:47:34,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14525 conditions, 6952 events. 4775/6952 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 39431 event pairs, 515 based on Foata normal form. 180/7131 useless extension candidates. Maximal degree in co-relation 14516. Up to 5950 conditions per place. [2025-02-06 12:47:34,996 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 49 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-02-06 12:47:34,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 236 flow [2025-02-06 12:47:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:47:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:47:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 12:47:34,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23711340206185566 [2025-02-06 12:47:34,998 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 92 transitions. [2025-02-06 12:47:34,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 236 flow [2025-02-06 12:47:34,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:47:34,999 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-02-06 12:47:34,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-02-06 12:47:35,000 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -53 predicate places. [2025-02-06 12:47:35,000 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-02-06 12:47:35,000 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-06 12:47:35,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:35,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:35,010 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-06 12:47:35,201 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-06 12:47:35,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:35,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1911161671, now seen corresponding path program 1 times [2025-02-06 12:47:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [131823932] [2025-02-06 12:47:35,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:35,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:35,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:35,204 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-06 12:47:35,206 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-06 12:47:35,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:47:35,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:47:35,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:35,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:35,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:47:35,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:35,364 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-06 12:47:35,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:35,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:35,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131823932] [2025-02-06 12:47:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131823932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:35,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621002903] [2025-02-06 12:47:35,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:35,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:35,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:35,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:35,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 97 [2025-02-06 12:47:35,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 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-06 12:47:35,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:35,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 97 [2025-02-06 12:47:35,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:35,918 INFO L124 PetriNetUnfolderBase]: 4775/7463 cut-off events. [2025-02-06 12:47:35,918 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-02-06 12:47:35,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15035 conditions, 7463 events. 4775/7463 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44217 event pairs, 4775 based on Foata normal form. 216/7674 useless extension candidates. Maximal degree in co-relation 15027. Up to 6804 conditions per place. [2025-02-06 12:47:35,944 INFO L140 encePairwiseOnDemand]: 95/97 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 12:47:35,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 141 flow [2025-02-06 12:47:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:47:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:47:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 12:47:35,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1958762886597938 [2025-02-06 12:47:35,945 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 57 transitions. [2025-02-06 12:47:35,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 141 flow [2025-02-06 12:47:35,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:35,946 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-02-06 12:47:35,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-02-06 12:47:35,947 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -54 predicate places. [2025-02-06 12:47:35,947 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-02-06 12:47:35,947 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-06 12:47:35,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:35,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:35,954 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-06 12:47:36,148 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-06 12:47:36,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:36,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1911164095, now seen corresponding path program 1 times [2025-02-06 12:47:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:36,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630789579] [2025-02-06 12:47:36,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:36,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:36,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:36,151 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-06 12:47:36,152 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-06 12:47:36,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:47:36,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:47:36,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:36,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:36,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:47:36,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:36,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:36,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:36,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630789579] [2025-02-06 12:47:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630789579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:36,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:36,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:47:36,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018880867] [2025-02-06 12:47:36,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:36,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:47:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:36,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:47:36,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:47:36,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:36,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 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-06 12:47:36,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:36,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:36,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:36,869 INFO L124 PetriNetUnfolderBase]: 3471/5583 cut-off events. [2025-02-06 12:47:36,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:36,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11275 conditions, 5583 events. 3471/5583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 33070 event pairs, 535 based on Foata normal form. 216/5796 useless extension candidates. Maximal degree in co-relation 11267. Up to 3001 conditions per place. [2025-02-06 12:47:36,889 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 55 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2025-02-06 12:47:36,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 276 flow [2025-02-06 12:47:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:47:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:47:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-06 12:47:36,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2654639175257732 [2025-02-06 12:47:36,890 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 103 transitions. [2025-02-06 12:47:36,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 276 flow [2025-02-06 12:47:36,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:47:36,892 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2025-02-06 12:47:36,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-02-06 12:47:36,892 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -51 predicate places. [2025-02-06 12:47:36,893 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2025-02-06 12:47:36,893 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-06 12:47:36,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:36,893 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-06 12:47:36,900 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-06 12:47:37,093 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-06 12:47:37,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:37,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash -227736145, now seen corresponding path program 1 times [2025-02-06 12:47:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:37,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389840415] [2025-02-06 12:47:37,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:37,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:37,097 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-06 12:47:37,148 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-06 12:47:37,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:47:37,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:47:37,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:37,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:37,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:47:37,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:37,325 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-06 12:47:37,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:37,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389840415] [2025-02-06 12:47:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389840415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:37,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:47:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223266115] [2025-02-06 12:47:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:37,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:47:37,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:37,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:47:37,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:47:37,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:37,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 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-06 12:47:37,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:37,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:37,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:37,919 INFO L124 PetriNetUnfolderBase]: 1935/3119 cut-off events. [2025-02-06 12:47:37,919 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2025-02-06 12:47:37,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7318 conditions, 3119 events. 1935/3119 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 15887 event pairs, 339 based on Foata normal form. 152/3268 useless extension candidates. Maximal degree in co-relation 7307. Up to 985 conditions per place. [2025-02-06 12:47:37,931 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 70 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-02-06 12:47:37,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 394 flow [2025-02-06 12:47:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:47:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:47:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-02-06 12:47:37,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27010309278350514 [2025-02-06 12:47:37,932 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 131 transitions. [2025-02-06 12:47:37,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 394 flow [2025-02-06 12:47:37,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 384 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:37,937 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2025-02-06 12:47:37,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-02-06 12:47:37,938 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -47 predicate places. [2025-02-06 12:47:37,938 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2025-02-06 12:47:37,938 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-06 12:47:37,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:37,938 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-06 12:47:37,949 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-06 12:47:38,138 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-06 12:47:38,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:38,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash 929226601, now seen corresponding path program 1 times [2025-02-06 12:47:38,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:38,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1487228732] [2025-02-06 12:47:38,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:38,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:38,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:38,143 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-06 12:47:38,146 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-06 12:47:38,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:47:38,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:47:38,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:38,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:38,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:47:38,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:38,338 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-06 12:47:38,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:38,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:38,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487228732] [2025-02-06 12:47:38,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487228732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:38,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:38,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:47:38,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408117011] [2025-02-06 12:47:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:38,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:38,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:38,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:38,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:38,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:38,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 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-06 12:47:38,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:38,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:38,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:38,734 INFO L124 PetriNetUnfolderBase]: 1167/1823 cut-off events. [2025-02-06 12:47:38,734 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2025-02-06 12:47:38,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4750 conditions, 1823 events. 1167/1823 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8088 event pairs, 303 based on Foata normal form. 56/1876 useless extension candidates. Maximal degree in co-relation 4737. Up to 672 conditions per place. [2025-02-06 12:47:38,741 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 59 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2025-02-06 12:47:38,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 383 flow [2025-02-06 12:47:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:47:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:47:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-02-06 12:47:38,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22852233676975944 [2025-02-06 12:47:38,742 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 133 transitions. [2025-02-06 12:47:38,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 383 flow [2025-02-06 12:47:38,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 358 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:47:38,751 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2025-02-06 12:47:38,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2025-02-06 12:47:38,751 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -44 predicate places. [2025-02-06 12:47:38,751 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2025-02-06 12:47:38,752 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-06 12:47:38,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:38,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:38,761 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-06 12:47:38,952 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-06 12:47:38,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:38,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash 21523083, now seen corresponding path program 1 times [2025-02-06 12:47:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [686918384] [2025-02-06 12:47:38,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:38,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:38,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:38,955 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-06 12:47:38,957 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-06 12:47:39,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:39,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:39,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:39,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:39,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:47:39,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:39,319 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-06 12:47:39,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:39,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:39,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686918384] [2025-02-06 12:47:39,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686918384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:39,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:47:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278261005] [2025-02-06 12:47:39,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:39,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:47:39,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:39,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:47:39,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:47:39,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:39,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 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-06 12:47:39,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:39,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:39,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:39,718 INFO L124 PetriNetUnfolderBase]: 1713/2677 cut-off events. [2025-02-06 12:47:39,719 INFO L125 PetriNetUnfolderBase]: For 1858/1858 co-relation queries the response was YES. [2025-02-06 12:47:39,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7057 conditions, 2677 events. 1713/2677 cut-off events. For 1858/1858 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12980 event pairs, 275 based on Foata normal form. 8/2683 useless extension candidates. Maximal degree in co-relation 7043. Up to 1091 conditions per place. [2025-02-06 12:47:39,727 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 63 selfloop transitions, 7 changer transitions 25/101 dead transitions. [2025-02-06 12:47:39,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 577 flow [2025-02-06 12:47:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:47:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:47:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-02-06 12:47:39,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23122238586156113 [2025-02-06 12:47:39,729 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 7 states and 157 transitions. [2025-02-06 12:47:39,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 577 flow [2025-02-06 12:47:39,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 101 transitions, 460 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:47:39,739 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 168 flow [2025-02-06 12:47:39,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2025-02-06 12:47:39,739 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -41 predicate places. [2025-02-06 12:47:39,740 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 168 flow [2025-02-06 12:47:39,740 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-06 12:47:39,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:39,740 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-06 12:47:39,747 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-06 12:47:39,940 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-06 12:47:39,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:39,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash 408214491, now seen corresponding path program 2 times [2025-02-06 12:47:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084193168] [2025-02-06 12:47:39,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:47:39,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:39,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:39,943 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-06 12:47:39,944 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-06 12:47:40,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:40,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:40,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:47:40,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:40,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 12:47:40,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:40,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 12:47:40,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 12:47:40,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 12:47:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:40,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:40,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:40,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084193168] [2025-02-06 12:47:40,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084193168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:40,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:47:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334568681] [2025-02-06 12:47:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:40,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:47:40,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:40,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:47:40,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:47:40,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:40,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 168 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-06 12:47:40,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:40,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:40,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:41,238 INFO L124 PetriNetUnfolderBase]: 1203/1923 cut-off events. [2025-02-06 12:47:41,239 INFO L125 PetriNetUnfolderBase]: For 574/576 co-relation queries the response was YES. [2025-02-06 12:47:41,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4674 conditions, 1923 events. 1203/1923 cut-off events. For 574/576 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8396 event pairs, 241 based on Foata normal form. 8/1931 useless extension candidates. Maximal degree in co-relation 4659. Up to 896 conditions per place. [2025-02-06 12:47:41,246 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 56 selfloop transitions, 17 changer transitions 22/101 dead transitions. [2025-02-06 12:47:41,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 101 transitions, 515 flow [2025-02-06 12:47:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:47:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:47:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2025-02-06 12:47:41,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2027491408934708 [2025-02-06 12:47:41,247 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 168 flow. Second operand 9 states and 177 transitions. [2025-02-06 12:47:41,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 101 transitions, 515 flow [2025-02-06 12:47:41,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 501 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 12:47:41,250 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 252 flow [2025-02-06 12:47:41,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-02-06 12:47:41,250 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -33 predicate places. [2025-02-06 12:47:41,250 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 252 flow [2025-02-06 12:47:41,251 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-06 12:47:41,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:41,251 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-06 12:47:41,259 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-06 12:47:41,451 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-06 12:47:41,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:41,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash -626246591, now seen corresponding path program 3 times [2025-02-06 12:47:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:41,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388770912] [2025-02-06 12:47:41,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:47:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:41,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:41,456 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-06 12:47:41,457 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-06 12:47:41,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:41,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:41,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:47:41,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:41,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 12:47:41,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:41,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 12:47:41,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 12:47:42,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 12:47:42,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 12:47:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:42,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:42,363 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388770912] [2025-02-06 12:47:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388770912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:42,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:42,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:47:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598889578] [2025-02-06 12:47:42,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:42,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:47:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:42,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:47:42,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:47:42,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:42,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 252 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:42,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:42,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:42,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:43,020 INFO L124 PetriNetUnfolderBase]: 1351/2167 cut-off events. [2025-02-06 12:47:43,021 INFO L125 PetriNetUnfolderBase]: For 1267/1269 co-relation queries the response was YES. [2025-02-06 12:47:43,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5924 conditions, 2167 events. 1351/2167 cut-off events. For 1267/1269 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9881 event pairs, 301 based on Foata normal form. 8/2175 useless extension candidates. Maximal degree in co-relation 5905. Up to 916 conditions per place. [2025-02-06 12:47:43,030 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 57 selfloop transitions, 17 changer transitions 24/104 dead transitions. [2025-02-06 12:47:43,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 104 transitions, 621 flow [2025-02-06 12:47:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:47:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:47:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2025-02-06 12:47:43,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2027491408934708 [2025-02-06 12:47:43,033 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 252 flow. Second operand 9 states and 177 transitions. [2025-02-06 12:47:43,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 104 transitions, 621 flow [2025-02-06 12:47:43,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 104 transitions, 593 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-06 12:47:43,038 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 301 flow [2025-02-06 12:47:43,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=301, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2025-02-06 12:47:43,040 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -29 predicate places. [2025-02-06 12:47:43,041 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 301 flow [2025-02-06 12:47:43,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:43,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:43,041 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-06 12:47:43,050 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-06 12:47:43,242 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-06 12:47:43,242 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:43,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash 803345081, now seen corresponding path program 4 times [2025-02-06 12:47:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93907277] [2025-02-06 12:47:43,243 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:47:43,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:43,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:43,245 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-06 12:47:43,246 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-06 12:47:43,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 12:47:43,448 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:43,448 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:47:43,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:43,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 12:47:43,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:43,580 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:47:43,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2025-02-06 12:47:43,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 12:47:43,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 12:47:44,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-06 12:47:44,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:44,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93907277] [2025-02-06 12:47:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93907277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:44,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:44,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:47:44,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435533225] [2025-02-06 12:47:44,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:44,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:47:44,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:44,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:47:44,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:47:44,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:44,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 301 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:44,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:44,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:44,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:44,880 INFO L124 PetriNetUnfolderBase]: 1411/2283 cut-off events. [2025-02-06 12:47:44,880 INFO L125 PetriNetUnfolderBase]: For 1723/1725 co-relation queries the response was YES. [2025-02-06 12:47:44,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 2283 events. 1411/2283 cut-off events. For 1723/1725 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10742 event pairs, 239 based on Foata normal form. 8/2291 useless extension candidates. Maximal degree in co-relation 6539. Up to 692 conditions per place. [2025-02-06 12:47:44,890 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 60 selfloop transitions, 10 changer transitions 48/124 dead transitions. [2025-02-06 12:47:44,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 124 transitions, 800 flow [2025-02-06 12:47:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:47:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:47:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2025-02-06 12:47:44,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21764032073310424 [2025-02-06 12:47:44,891 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 301 flow. Second operand 9 states and 190 transitions. [2025-02-06 12:47:44,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 124 transitions, 800 flow [2025-02-06 12:47:44,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 124 transitions, 761 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-02-06 12:47:44,901 INFO L231 Difference]: Finished difference. Result has 79 places, 53 transitions, 301 flow [2025-02-06 12:47:44,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=301, PETRI_PLACES=79, PETRI_TRANSITIONS=53} [2025-02-06 12:47:44,902 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -23 predicate places. [2025-02-06 12:47:44,902 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 53 transitions, 301 flow [2025-02-06 12:47:44,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:44,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:44,902 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-06 12:47:44,910 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-06 12:47:45,102 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-06 12:47:45,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:45,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1006099229, now seen corresponding path program 5 times [2025-02-06 12:47:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:45,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958809804] [2025-02-06 12:47:45,104 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:47:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:45,106 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-06 12:47:45,107 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-06 12:47:45,226 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:45,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:45,257 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:47:45,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:45,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 12:47:45,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:45,356 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:47:45,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2025-02-06 12:47:45,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 12:47:45,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 12:47:45,921 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-06 12:47:45,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:45,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:45,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958809804] [2025-02-06 12:47:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958809804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:47:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567230424] [2025-02-06 12:47:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:45,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:47:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:45,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:47:45,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:47:45,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 97 [2025-02-06 12:47:45,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 53 transitions, 301 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:45,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:45,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 97 [2025-02-06 12:47:45,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:46,661 INFO L124 PetriNetUnfolderBase]: 737/1229 cut-off events. [2025-02-06 12:47:46,661 INFO L125 PetriNetUnfolderBase]: For 1098/1101 co-relation queries the response was YES. [2025-02-06 12:47:46,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3485 conditions, 1229 events. 737/1229 cut-off events. For 1098/1101 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4766 event pairs, 73 based on Foata normal form. 9/1238 useless extension candidates. Maximal degree in co-relation 3461. Up to 601 conditions per place. [2025-02-06 12:47:46,668 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 54 selfloop transitions, 7 changer transitions 24/91 dead transitions. [2025-02-06 12:47:46,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 91 transitions, 578 flow [2025-02-06 12:47:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2025-02-06 12:47:46,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19329896907216496 [2025-02-06 12:47:46,669 INFO L175 Difference]: Start difference. First operand has 79 places, 53 transitions, 301 flow. Second operand 8 states and 150 transitions. [2025-02-06 12:47:46,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 91 transitions, 578 flow [2025-02-06 12:47:46,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 501 flow, removed 23 selfloop flow, removed 11 redundant places. [2025-02-06 12:47:46,675 INFO L231 Difference]: Finished difference. Result has 75 places, 50 transitions, 238 flow [2025-02-06 12:47:46,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=75, PETRI_TRANSITIONS=50} [2025-02-06 12:47:46,675 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -27 predicate places. [2025-02-06 12:47:46,675 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 50 transitions, 238 flow [2025-02-06 12:47:46,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:46,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:46,676 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-06 12:47:46,682 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-06 12:47:46,876 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-06 12:47:46,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 92 more)] === [2025-02-06 12:47:46,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash -906486225, now seen corresponding path program 6 times [2025-02-06 12:47:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:46,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366121292] [2025-02-06 12:47:46,877 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 12:47:46,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:46,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:46,879 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-06 12:47:46,880 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-06 12:47:46,997 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:47,063 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:47,064 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 12:47:47,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:47:47,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:47:47,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:47,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:47,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:47,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:47:47,220 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:47:47,220 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:47:47,221 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (94 of 95 remaining) [2025-02-06 12:47:47,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 95 remaining) [2025-02-06 12:47:47,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 95 remaining) [2025-02-06 12:47:47,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 95 remaining) [2025-02-06 12:47:47,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 95 remaining) [2025-02-06 12:47:47,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 95 remaining) [2025-02-06 12:47:47,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 95 remaining) [2025-02-06 12:47:47,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 95 remaining) [2025-02-06 12:47:47,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 95 remaining) [2025-02-06 12:47:47,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 95 remaining) [2025-02-06 12:47:47,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 95 remaining) [2025-02-06 12:47:47,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 95 remaining) [2025-02-06 12:47:47,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 95 remaining) [2025-02-06 12:47:47,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 95 remaining) [2025-02-06 12:47:47,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 95 remaining) [2025-02-06 12:47:47,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 95 remaining) [2025-02-06 12:47:47,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 95 remaining) [2025-02-06 12:47:47,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 95 remaining) [2025-02-06 12:47:47,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 95 remaining) [2025-02-06 12:47:47,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 95 remaining) [2025-02-06 12:47:47,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 95 remaining) [2025-02-06 12:47:47,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 95 remaining) [2025-02-06 12:47:47,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 95 remaining) [2025-02-06 12:47:47,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 95 remaining) [2025-02-06 12:47:47,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (39 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 95 remaining) [2025-02-06 12:47:47,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 95 remaining) [2025-02-06 12:47:47,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 95 remaining) [2025-02-06 12:47:47,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 95 remaining) [2025-02-06 12:47:47,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 95 remaining) [2025-02-06 12:47:47,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 95 remaining) [2025-02-06 12:47:47,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 95 remaining) [2025-02-06 12:47:47,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 95 remaining) [2025-02-06 12:47:47,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 95 remaining) [2025-02-06 12:47:47,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 12:47:47,432 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-06 12:47:47,432 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:47,544 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:47:47,544 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:47:47,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:47:47 BasicIcfg [2025-02-06 12:47:47,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:47:47,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:47:47,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:47:47,553 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:47:47,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:22" (3/4) ... [2025-02-06 12:47:47,556 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:47:47,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:47:47,558 INFO L158 Benchmark]: Toolchain (without parser) took 27130.42ms. Allocated memory was 83.9MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 58.1MB in the beginning and 903.1MB in the end (delta: -845.0MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-02-06 12:47:47,558 INFO L158 Benchmark]: CDTParser took 1.30ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:47,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.08ms. Allocated memory is still 83.9MB. Free memory was 58.1MB in the beginning and 32.7MB in the end (delta: 25.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:47:47,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.32ms. Allocated memory is still 83.9MB. Free memory was 32.7MB in the beginning and 30.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:47,559 INFO L158 Benchmark]: Boogie Preprocessor took 90.46ms. Allocated memory is still 83.9MB. Free memory was 30.2MB in the beginning and 26.1MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:47:47,559 INFO L158 Benchmark]: IcfgBuilder took 1538.18ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 26.1MB in the beginning and 28.4MB in the end (delta: -2.3MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2025-02-06 12:47:47,559 INFO L158 Benchmark]: TraceAbstraction took 24925.98ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 28.4MB in the beginning and 903.2MB in the end (delta: -874.8MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-02-06 12:47:47,559 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 2.3GB. Free memory was 903.2MB in the beginning and 903.1MB in the end (delta: 93.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:47,562 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.08ms. Allocated memory is still 83.9MB. Free memory was 58.1MB in the beginning and 32.7MB in the end (delta: 25.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.32ms. Allocated memory is still 83.9MB. Free memory was 32.7MB in the beginning and 30.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 90.46ms. Allocated memory is still 83.9MB. Free memory was 30.2MB in the beginning and 26.1MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1538.18ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 26.1MB in the beginning and 28.4MB in the end (delta: -2.3MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24925.98ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 28.4MB in the beginning and 903.2MB in the end (delta: -874.8MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 2.3GB. Free memory was 903.2MB in the beginning and 903.1MB in the end (delta: 93.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1789=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1790; [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789=-2, t1790=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1791; [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789=-2, t1790=-1, t1791=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789=-2, t1790=-1, t1791=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789=-2, t1790=-1, t1791=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789=-2, t1790=-1, t1791=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe000_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: 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, 156 locations, 95 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: 24.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1007 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 985 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2314 IncrementalHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 13 mSDtfsCounter, 2314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=12, InterpolantAutomatonStates: 77, 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.4s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 3304 SizeOfPredicates, 65 NumberOfNonLiveVariables, 2323 ConjunctsInSsa, 154 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-06 12:47:47,590 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