./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi006_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 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:48:15,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:48:15,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:48:15,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:48:15,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:48:15,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:48:15,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:48:15,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:48:15,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:48:15,263 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:48:15,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:48:15,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:48:15,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:48:15,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:48:15,263 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:48:15,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:48:15,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:48:15,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:48:15,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:48:15,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:48:15,263 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:48:15,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:15,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:15,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:15,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:15,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:15,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:48:15,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:48:15,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:48:15,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:48:15,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:48:15,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:48:15,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:48:15,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:48:15,270 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 -> 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 [2025-01-10 00:48:15,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:48:15,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:48:15,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:48:15,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:48:15,591 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:48:15,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2025-01-10 00:48:16,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a59314a26/1e4ef79aa8464189b564e1244f9762b9/FLAG971c7ac60 [2025-01-10 00:48:17,135 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:48:17,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2025-01-10 00:48:17,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a59314a26/1e4ef79aa8464189b564e1244f9762b9/FLAG971c7ac60 [2025-01-10 00:48:17,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a59314a26/1e4ef79aa8464189b564e1244f9762b9 [2025-01-10 00:48:17,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:48:17,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:48:17,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:17,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:48:17,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:48:17,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4feb8084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17, skipping insertion in model container [2025-01-10 00:48:17,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:48:17,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:17,720 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:48:17,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:17,815 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:48:17,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17 WrapperNode [2025-01-10 00:48:17,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:17,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:17,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:48:17,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:48:17,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,856 INFO L138 Inliner]: procedures = 175, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2025-01-10 00:48:17,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:17,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:48:17,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:48:17,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:48:17,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,886 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2025-01-10 00:48:17,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:48:17,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:48:17,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:48:17,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:48:17,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (1/1) ... [2025-01-10 00:48:17,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:17,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:17,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:48:17,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:48:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:48:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:48:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:48:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:48:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:48:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:48:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:48:17,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:48:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:48:17,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:48:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:48:17,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:48:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:48:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:48:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:48:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:48:17,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:48:17,970 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:48:18,066 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:48:18,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:48:18,482 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:48:18,482 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:48:18,807 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:48:18,808 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:48:18,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:18 BoogieIcfgContainer [2025-01-10 00:48:18,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:48:18,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:48:18,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:48:18,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:48:18,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:48:17" (1/3) ... [2025-01-10 00:48:18,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d15ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:18, skipping insertion in model container [2025-01-10 00:48:18,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:17" (2/3) ... [2025-01-10 00:48:18,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d15ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:18, skipping insertion in model container [2025-01-10 00:48:18,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:18" (3/3) ... [2025-01-10 00:48:18,814 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i [2025-01-10 00:48:18,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:48:18,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi006_rmo.i that has 4 procedures, 78 locations, 1 initial locations, 0 loop locations, and 38 error locations. [2025-01-10 00:48:18,827 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:48:18,918 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:48:18,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 170 flow [2025-01-10 00:48:18,975 INFO L124 PetriNetUnfolderBase]: 2/76 cut-off events. [2025-01-10 00:48:18,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:18,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 297 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-01-10 00:48:18,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 79 transitions, 170 flow [2025-01-10 00:48:18,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 76 transitions, 161 flow [2025-01-10 00:48:18,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:48:19,004 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;@5ac1d03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:48:19,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-01-10 00:48:19,028 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:48:19,029 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 00:48:19,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:19,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:19,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:48:19,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:19,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash 21804362, now seen corresponding path program 1 times [2025-01-10 00:48:19,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:19,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002986492] [2025-01-10 00:48:19,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:19,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:48:19,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:48:19,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:19,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:19,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:19,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002986492] [2025-01-10 00:48:19,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002986492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:19,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:19,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:19,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565971617] [2025-01-10 00:48:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:19,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:19,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:19,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:19,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:19,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:19,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:19,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:19,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:20,456 INFO L124 PetriNetUnfolderBase]: 3375/5456 cut-off events. [2025-01-10 00:48:20,457 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:20,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10375 conditions, 5456 events. 3375/5456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 42027 event pairs, 3375 based on Foata normal form. 224/3842 useless extension candidates. Maximal degree in co-relation 10364. Up to 4872 conditions per place. [2025-01-10 00:48:20,503 INFO L140 encePairwiseOnDemand]: 49/79 looper letters, 29 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2025-01-10 00:48:20,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 161 flow [2025-01-10 00:48:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-01-10 00:48:20,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2025-01-10 00:48:20,517 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 3 states and 116 transitions. [2025-01-10 00:48:20,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 161 flow [2025-01-10 00:48:20,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:20,525 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 100 flow [2025-01-10 00:48:20,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2025-01-10 00:48:20,531 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2025-01-10 00:48:20,532 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 100 flow [2025-01-10 00:48:20,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:20,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:20,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:48:20,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:48:20,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:20,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash 21804363, now seen corresponding path program 1 times [2025-01-10 00:48:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:20,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918653931] [2025-01-10 00:48:20,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:20,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:48:20,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:48:20,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:20,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918653931] [2025-01-10 00:48:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918653931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070765311] [2025-01-10 00:48:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:20,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:20,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:20,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:20,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:20,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:20,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:20,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:20,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:20,975 INFO L124 PetriNetUnfolderBase]: 818/1456 cut-off events. [2025-01-10 00:48:20,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:20,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1456 events. 818/1456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9798 event pairs, 818 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 2719. Up to 1239 conditions per place. [2025-01-10 00:48:20,982 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 21 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-01-10 00:48:20,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 132 flow [2025-01-10 00:48:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 00:48:20,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3670886075949367 [2025-01-10 00:48:20,983 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 100 flow. Second operand 3 states and 87 transitions. [2025-01-10 00:48:20,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 132 flow [2025-01-10 00:48:20,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:20,984 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2025-01-10 00:48:20,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:20,985 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places. [2025-01-10 00:48:20,985 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2025-01-10 00:48:20,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:20,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:20,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:20,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:48:20,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:20,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash -82607636, now seen corresponding path program 1 times [2025-01-10 00:48:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:20,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484663102] [2025-01-10 00:48:20,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:20,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:48:21,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:48:21,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:21,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:21,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:21,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484663102] [2025-01-10 00:48:21,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484663102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:21,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:21,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:21,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96481323] [2025-01-10 00:48:21,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:21,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:21,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:21,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:21,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:21,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:21,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:21,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:21,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:21,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:21,388 INFO L124 PetriNetUnfolderBase]: 685/1362 cut-off events. [2025-01-10 00:48:21,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:21,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1362 events. 685/1362 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8980 event pairs, 253 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 2432. Up to 813 conditions per place. [2025-01-10 00:48:21,396 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 36 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-01-10 00:48:21,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 197 flow [2025-01-10 00:48:21,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-01-10 00:48:21,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4092827004219409 [2025-01-10 00:48:21,398 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 97 transitions. [2025-01-10 00:48:21,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 197 flow [2025-01-10 00:48:21,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:21,399 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-01-10 00:48:21,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:21,400 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2025-01-10 00:48:21,400 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-01-10 00:48:21,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:21,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:21,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:21,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:48:21,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:21,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2076444609, now seen corresponding path program 1 times [2025-01-10 00:48:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:21,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197347019] [2025-01-10 00:48:21,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:21,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:48:21,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:48:21,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:21,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197347019] [2025-01-10 00:48:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197347019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:21,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:21,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:48:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534883839] [2025-01-10 00:48:21,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:21,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:21,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:21,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:21,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:21,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:21,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:21,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:21,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:21,859 INFO L124 PetriNetUnfolderBase]: 639/1360 cut-off events. [2025-01-10 00:48:21,859 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-01-10 00:48:21,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 1360 events. 639/1360 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9588 event pairs, 141 based on Foata normal form. 0/1342 useless extension candidates. Maximal degree in co-relation 2592. Up to 742 conditions per place. [2025-01-10 00:48:21,868 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 35 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-01-10 00:48:21,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 200 flow [2025-01-10 00:48:21,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-01-10 00:48:21,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36075949367088606 [2025-01-10 00:48:21,872 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 114 transitions. [2025-01-10 00:48:21,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 200 flow [2025-01-10 00:48:21,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:21,873 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-01-10 00:48:21,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:21,873 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2025-01-10 00:48:21,873 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-01-10 00:48:21,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:21,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:21,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:21,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:48:21,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:21,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2076444608, now seen corresponding path program 1 times [2025-01-10 00:48:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:21,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704792071] [2025-01-10 00:48:21,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:21,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:48:21,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:48:21,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:21,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:22,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704792071] [2025-01-10 00:48:22,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704792071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:22,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:22,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:48:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443737296] [2025-01-10 00:48:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:22,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:22,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:22,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:22,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:22,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:22,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:22,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:22,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:22,337 INFO L124 PetriNetUnfolderBase]: 593/1222 cut-off events. [2025-01-10 00:48:22,338 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-01-10 00:48:22,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 1222 events. 593/1222 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7916 event pairs, 197 based on Foata normal form. 24/1240 useless extension candidates. Maximal degree in co-relation 2360. Up to 672 conditions per place. [2025-01-10 00:48:22,344 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-01-10 00:48:22,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2025-01-10 00:48:22,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-01-10 00:48:22,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3575949367088608 [2025-01-10 00:48:22,346 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 113 transitions. [2025-01-10 00:48:22,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2025-01-10 00:48:22,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 189 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:22,347 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-01-10 00:48:22,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:22,347 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places. [2025-01-10 00:48:22,347 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-01-10 00:48:22,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:22,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:22,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:22,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:48:22,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:22,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1640065352, now seen corresponding path program 1 times [2025-01-10 00:48:22,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:22,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136998594] [2025-01-10 00:48:22,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:22,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:48:22,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:48:22,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:22,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:22,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:22,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136998594] [2025-01-10 00:48:22,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136998594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:22,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:22,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770286153] [2025-01-10 00:48:22,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:22,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:22,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:22,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:22,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:22,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 79 [2025-01-10 00:48:22,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:22,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:22,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 79 [2025-01-10 00:48:22,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:22,547 INFO L124 PetriNetUnfolderBase]: 593/1087 cut-off events. [2025-01-10 00:48:22,547 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-01-10 00:48:22,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 1087 events. 593/1087 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6984 event pairs, 593 based on Foata normal form. 36/1107 useless extension candidates. Maximal degree in co-relation 2225. Up to 906 conditions per place. [2025-01-10 00:48:22,553 INFO L140 encePairwiseOnDemand]: 77/79 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-01-10 00:48:22,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 123 flow [2025-01-10 00:48:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-01-10 00:48:22,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31645569620253167 [2025-01-10 00:48:22,555 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 75 transitions. [2025-01-10 00:48:22,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 123 flow [2025-01-10 00:48:22,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:22,556 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-01-10 00:48:22,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:22,557 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -36 predicate places. [2025-01-10 00:48:22,557 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-01-10 00:48:22,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:22,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:22,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:22,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:48:22,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:22,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:22,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1640064561, now seen corresponding path program 1 times [2025-01-10 00:48:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567376408] [2025-01-10 00:48:22,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:22,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:22,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:48:22,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:48:22,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:22,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:22,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:22,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567376408] [2025-01-10 00:48:22,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567376408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:22,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:22,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:22,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156280063] [2025-01-10 00:48:22,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:22,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:22,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:22,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:22,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:22,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 79 [2025-01-10 00:48:22,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:22,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:22,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 79 [2025-01-10 00:48:22,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:23,059 INFO L124 PetriNetUnfolderBase]: 678/1291 cut-off events. [2025-01-10 00:48:23,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:23,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2558 conditions, 1291 events. 678/1291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8413 event pairs, 181 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 2550. Up to 555 conditions per place. [2025-01-10 00:48:23,066 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 29 selfloop transitions, 2 changer transitions 36/81 dead transitions. [2025-01-10 00:48:23,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 316 flow [2025-01-10 00:48:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:48:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:48:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2025-01-10 00:48:23,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3370253164556962 [2025-01-10 00:48:23,067 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 8 states and 213 transitions. [2025-01-10 00:48:23,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 316 flow [2025-01-10 00:48:23,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:23,068 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 93 flow [2025-01-10 00:48:23,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:23,069 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -26 predicate places. [2025-01-10 00:48:23,069 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 93 flow [2025-01-10 00:48:23,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:23,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:23,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:23,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:48:23,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:23,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:23,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1706001660, now seen corresponding path program 1 times [2025-01-10 00:48:23,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:23,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383500833] [2025-01-10 00:48:23,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:23,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:23,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:48:23,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:48:23,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:23,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:23,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:23,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383500833] [2025-01-10 00:48:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383500833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:23,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:23,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715023891] [2025-01-10 00:48:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:23,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:23,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:23,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:23,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 79 [2025-01-10 00:48:23,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:23,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:23,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 79 [2025-01-10 00:48:23,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:23,545 INFO L124 PetriNetUnfolderBase]: 1010/1950 cut-off events. [2025-01-10 00:48:23,546 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-01-10 00:48:23,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4155 conditions, 1950 events. 1010/1950 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12812 event pairs, 247 based on Foata normal form. 48/1959 useless extension candidates. Maximal degree in co-relation 4141. Up to 1198 conditions per place. [2025-01-10 00:48:23,553 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 31 selfloop transitions, 3 changer transitions 29/75 dead transitions. [2025-01-10 00:48:23,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 322 flow [2025-01-10 00:48:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:48:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:48:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-01-10 00:48:23,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32007233273056057 [2025-01-10 00:48:23,555 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 93 flow. Second operand 7 states and 177 transitions. [2025-01-10 00:48:23,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 322 flow [2025-01-10 00:48:23,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 300 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 00:48:23,561 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 116 flow [2025-01-10 00:48:23,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2025-01-10 00:48:23,561 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -27 predicate places. [2025-01-10 00:48:23,562 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 116 flow [2025-01-10 00:48:23,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:23,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:23,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:23,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:48:23,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:23,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash -303582826, now seen corresponding path program 1 times [2025-01-10 00:48:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:23,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239231426] [2025-01-10 00:48:23,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:23,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:23,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:48:23,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:48:23,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:23,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:23,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:23,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239231426] [2025-01-10 00:48:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239231426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:48:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699875269] [2025-01-10 00:48:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:23,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:23,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:23,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:23,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:23,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 79 [2025-01-10 00:48:23,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:23,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:23,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 79 [2025-01-10 00:48:23,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:24,056 INFO L124 PetriNetUnfolderBase]: 1276/2394 cut-off events. [2025-01-10 00:48:24,056 INFO L125 PetriNetUnfolderBase]: For 1106/1106 co-relation queries the response was YES. [2025-01-10 00:48:24,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5682 conditions, 2394 events. 1276/2394 cut-off events. For 1106/1106 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17022 event pairs, 556 based on Foata normal form. 56/2436 useless extension candidates. Maximal degree in co-relation 5667. Up to 1012 conditions per place. [2025-01-10 00:48:24,065 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 35 selfloop transitions, 3 changer transitions 29/79 dead transitions. [2025-01-10 00:48:24,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 374 flow [2025-01-10 00:48:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:48:24,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:48:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-01-10 00:48:24,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.325497287522604 [2025-01-10 00:48:24,066 INFO L175 Difference]: Start difference. First operand has 57 places, 35 transitions, 116 flow. Second operand 7 states and 180 transitions. [2025-01-10 00:48:24,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 374 flow [2025-01-10 00:48:24,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 353 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:24,073 INFO L231 Difference]: Finished difference. Result has 61 places, 35 transitions, 126 flow [2025-01-10 00:48:24,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=61, PETRI_TRANSITIONS=35} [2025-01-10 00:48:24,074 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2025-01-10 00:48:24,074 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 35 transitions, 126 flow [2025-01-10 00:48:24,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:24,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:24,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:24,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:48:24,075 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:24,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash -376267997, now seen corresponding path program 1 times [2025-01-10 00:48:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:24,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317977403] [2025-01-10 00:48:24,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:24,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:24,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:48:24,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:48:24,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:24,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:24,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:24,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317977403] [2025-01-10 00:48:24,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317977403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:24,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:24,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:24,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368238491] [2025-01-10 00:48:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:24,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:24,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:24,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:24,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:24,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 79 [2025-01-10 00:48:24,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 35 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:24,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:24,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 79 [2025-01-10 00:48:24,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:24,674 INFO L124 PetriNetUnfolderBase]: 1195/2290 cut-off events. [2025-01-10 00:48:24,674 INFO L125 PetriNetUnfolderBase]: For 1951/1991 co-relation queries the response was YES. [2025-01-10 00:48:24,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5362 conditions, 2290 events. 1195/2290 cut-off events. For 1951/1991 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16372 event pairs, 263 based on Foata normal form. 80/2281 useless extension candidates. Maximal degree in co-relation 5344. Up to 1289 conditions per place. [2025-01-10 00:48:24,689 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 28 selfloop transitions, 2 changer transitions 25/70 dead transitions. [2025-01-10 00:48:24,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 329 flow [2025-01-10 00:48:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:48:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:48:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-01-10 00:48:24,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3182640144665461 [2025-01-10 00:48:24,691 INFO L175 Difference]: Start difference. First operand has 61 places, 35 transitions, 126 flow. Second operand 7 states and 176 transitions. [2025-01-10 00:48:24,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 329 flow [2025-01-10 00:48:24,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 306 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-01-10 00:48:24,702 INFO L231 Difference]: Finished difference. Result has 63 places, 35 transitions, 127 flow [2025-01-10 00:48:24,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=63, PETRI_TRANSITIONS=35} [2025-01-10 00:48:24,704 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -21 predicate places. [2025-01-10 00:48:24,705 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 35 transitions, 127 flow [2025-01-10 00:48:24,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:24,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:24,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:24,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:48:24,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:24,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1319012049, now seen corresponding path program 1 times [2025-01-10 00:48:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90654678] [2025-01-10 00:48:24,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:24,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:48:24,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:48:24,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:24,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90654678] [2025-01-10 00:48:25,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90654678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:25,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:25,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:48:25,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621166741] [2025-01-10 00:48:25,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:25,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:48:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:25,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:48:25,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:48:25,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 79 [2025-01-10 00:48:25,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 35 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:25,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:25,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 79 [2025-01-10 00:48:25,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:25,774 INFO L124 PetriNetUnfolderBase]: 852/1672 cut-off events. [2025-01-10 00:48:25,775 INFO L125 PetriNetUnfolderBase]: For 1597/1615 co-relation queries the response was YES. [2025-01-10 00:48:25,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4080 conditions, 1672 events. 852/1672 cut-off events. For 1597/1615 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11504 event pairs, 154 based on Foata normal form. 60/1690 useless extension candidates. Maximal degree in co-relation 4060. Up to 862 conditions per place. [2025-01-10 00:48:25,783 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 32 selfloop transitions, 4 changer transitions 21/73 dead transitions. [2025-01-10 00:48:25,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 344 flow [2025-01-10 00:48:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:48:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:48:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2025-01-10 00:48:25,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3212025316455696 [2025-01-10 00:48:25,784 INFO L175 Difference]: Start difference. First operand has 63 places, 35 transitions, 127 flow. Second operand 8 states and 203 transitions. [2025-01-10 00:48:25,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 344 flow [2025-01-10 00:48:25,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 324 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 00:48:25,789 INFO L231 Difference]: Finished difference. Result has 66 places, 37 transitions, 147 flow [2025-01-10 00:48:25,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=147, PETRI_PLACES=66, PETRI_TRANSITIONS=37} [2025-01-10 00:48:25,790 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places. [2025-01-10 00:48:25,790 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 37 transitions, 147 flow [2025-01-10 00:48:25,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:25,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:25,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:25,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:48:25,791 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:25,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1375195782, now seen corresponding path program 1 times [2025-01-10 00:48:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:25,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592182389] [2025-01-10 00:48:25,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:25,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:25,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:48:25,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:48:25,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:25,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:25,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:25,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592182389] [2025-01-10 00:48:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592182389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:48:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89663429] [2025-01-10 00:48:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:25,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:25,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:25,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:25,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2025-01-10 00:48:25,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 37 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:25,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:25,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2025-01-10 00:48:25,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:26,221 INFO L124 PetriNetUnfolderBase]: 2083/3404 cut-off events. [2025-01-10 00:48:26,221 INFO L125 PetriNetUnfolderBase]: For 1816/1840 co-relation queries the response was YES. [2025-01-10 00:48:26,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8397 conditions, 3404 events. 2083/3404 cut-off events. For 1816/1840 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20826 event pairs, 291 based on Foata normal form. 135/3483 useless extension candidates. Maximal degree in co-relation 8375. Up to 1911 conditions per place. [2025-01-10 00:48:26,238 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 46 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2025-01-10 00:48:26,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 345 flow [2025-01-10 00:48:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-01-10 00:48:26,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34177215189873417 [2025-01-10 00:48:26,240 INFO L175 Difference]: Start difference. First operand has 66 places, 37 transitions, 147 flow. Second operand 4 states and 108 transitions. [2025-01-10 00:48:26,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 345 flow [2025-01-10 00:48:26,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 64 transitions, 330 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-10 00:48:26,246 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 170 flow [2025-01-10 00:48:26,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2025-01-10 00:48:26,247 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -22 predicate places. [2025-01-10 00:48:26,247 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 170 flow [2025-01-10 00:48:26,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:26,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:26,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:26,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:48:26,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:26,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2143098395, now seen corresponding path program 1 times [2025-01-10 00:48:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:26,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494723074] [2025-01-10 00:48:26,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:26,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:48:26,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:48:26,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:26,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:26,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:26,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494723074] [2025-01-10 00:48:26,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494723074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:26,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:26,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687089797] [2025-01-10 00:48:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:26,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:26,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:26,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:26,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:26,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2025-01-10 00:48:26,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:26,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:26,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2025-01-10 00:48:26,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:26,663 INFO L124 PetriNetUnfolderBase]: 1382/2284 cut-off events. [2025-01-10 00:48:26,663 INFO L125 PetriNetUnfolderBase]: For 1299/1303 co-relation queries the response was YES. [2025-01-10 00:48:26,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6134 conditions, 2284 events. 1382/2284 cut-off events. For 1299/1303 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12696 event pairs, 114 based on Foata normal form. 120/2368 useless extension candidates. Maximal degree in co-relation 6113. Up to 933 conditions per place. [2025-01-10 00:48:26,672 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 54 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2025-01-10 00:48:26,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 417 flow [2025-01-10 00:48:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:48:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:48:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-01-10 00:48:26,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34430379746835443 [2025-01-10 00:48:26,673 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 170 flow. Second operand 5 states and 136 transitions. [2025-01-10 00:48:26,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 417 flow [2025-01-10 00:48:26,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 407 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:26,675 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 210 flow [2025-01-10 00:48:26,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-01-10 00:48:26,676 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places. [2025-01-10 00:48:26,676 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 210 flow [2025-01-10 00:48:26,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:26,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:26,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] [2025-01-10 00:48:26,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:48:26,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:26,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1669553794, now seen corresponding path program 1 times [2025-01-10 00:48:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:26,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694950546] [2025-01-10 00:48:26,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:26,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:26,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:48:26,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:48:26,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:26,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:26,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694950546] [2025-01-10 00:48:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694950546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:48:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242728500] [2025-01-10 00:48:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:26,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:48:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:26,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:48:26,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:48:26,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2025-01-10 00:48:26,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:26,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:26,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2025-01-10 00:48:26,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:27,032 INFO L124 PetriNetUnfolderBase]: 800/1310 cut-off events. [2025-01-10 00:48:27,032 INFO L125 PetriNetUnfolderBase]: For 1455/1455 co-relation queries the response was YES. [2025-01-10 00:48:27,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 1310 events. 800/1310 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6391 event pairs, 66 based on Foata normal form. 68/1346 useless extension candidates. Maximal degree in co-relation 3901. Up to 496 conditions per place. [2025-01-10 00:48:27,039 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 45 selfloop transitions, 11 changer transitions 4/72 dead transitions. [2025-01-10 00:48:27,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 72 transitions, 421 flow [2025-01-10 00:48:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:48:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:48:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-01-10 00:48:27,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31223628691983124 [2025-01-10 00:48:27,040 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 210 flow. Second operand 6 states and 148 transitions. [2025-01-10 00:48:27,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 72 transitions, 421 flow [2025-01-10 00:48:27,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 367 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-01-10 00:48:27,044 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 201 flow [2025-01-10 00:48:27,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=201, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2025-01-10 00:48:27,045 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2025-01-10 00:48:27,046 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 201 flow [2025-01-10 00:48:27,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:27,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:27,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:27,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:48:27,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:27,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash 884823844, now seen corresponding path program 1 times [2025-01-10 00:48:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436751186] [2025-01-10 00:48:27,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:27,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:27,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:27,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:27,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:27,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:27,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:48:27,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:27,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:27,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:27,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:27,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:48:27,213 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:48:27,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2025-01-10 00:48:27,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2025-01-10 00:48:27,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2025-01-10 00:48:27,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2025-01-10 00:48:27,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2025-01-10 00:48:27,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2025-01-10 00:48:27,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2025-01-10 00:48:27,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2025-01-10 00:48:27,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (33 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2025-01-10 00:48:27,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2025-01-10 00:48:27,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2025-01-10 00:48:27,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2025-01-10 00:48:27,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2025-01-10 00:48:27,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2025-01-10 00:48:27,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:48:27,229 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:27,308 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:48:27,312 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:48:27,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:48:27 BasicIcfg [2025-01-10 00:48:27,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:48:27,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:48:27,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:48:27,324 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:48:27,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:18" (3/4) ... [2025-01-10 00:48:27,325 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:48:27,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:48:27,327 INFO L158 Benchmark]: Toolchain (without parser) took 9892.34ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 108.7MB in the beginning and 740.6MB in the end (delta: -631.9MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2025-01-10 00:48:27,327 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:27,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.22ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 84.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:48:27,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.39ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 82.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:27,331 INFO L158 Benchmark]: Boogie Preprocessor took 53.05ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 79.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:48:27,331 INFO L158 Benchmark]: RCFGBuilder took 898.35ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 86.8MB in the end (delta: -8.8MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2025-01-10 00:48:27,331 INFO L158 Benchmark]: TraceAbstraction took 8509.73ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 86.1MB in the beginning and 740.7MB in the end (delta: -654.7MB). Peak memory consumption was 505.8MB. Max. memory is 16.1GB. [2025-01-10 00:48:27,331 INFO L158 Benchmark]: Witness Printer took 6.33ms. Allocated memory is still 838.9MB. Free memory was 740.7MB in the beginning and 740.6MB in the end (delta: 113.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:27,332 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.46ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.22ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 84.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.39ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 82.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.05ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 79.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 898.35ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 86.8MB in the end (delta: -8.8MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8509.73ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 86.1MB in the beginning and 740.7MB in the end (delta: -654.7MB). Peak memory consumption was 505.8MB. Max. memory is 16.1GB. * Witness Printer took 6.33ms. Allocated memory is still 838.9MB. Free memory was 740.7MB in the beginning and 740.6MB in the end (delta: 113.2kB). 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_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L847] 0 pthread_t t1693; [L848] FCALL, FORK 0 pthread_create(&t1693, ((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_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1693=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 \read(x) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L774] EXPR 1 \read(x) [L774] 1 __unbuffered_p0_EAX = x [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] EXPR 1 \read(x) [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] 1 x = x$flush_delayed ? x$mem_tmp : x [L776] 1 x$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_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L849] 0 pthread_t t1694; [L850] FCALL, FORK 0 pthread_create(&t1694, ((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_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1693=-1, t1694=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L779] 1 y = 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_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L791] 2 y = 2 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_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L794] 2 __unbuffered_p1_EAX = y 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L797] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 2 x$flush_delayed = weak$$choice2 [L800] EXPR 2 \read(x) [L800] 2 x$mem_tmp = x [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] EXPR 2 \read(x) [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 \read(x) [L808] 2 __unbuffered_p1_EBX = x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] 2 x = x$flush_delayed ? x$mem_tmp : x [L810] 2 x$flush_delayed = (_Bool)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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L851] 0 pthread_t t1695; [L852] FCALL, FORK 0 pthread_create(&t1695, ((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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1693=-1, t1694=0, t1695=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L822] 3 x = 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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L815] 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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L832] 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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L854] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=-1, t1694=0, t1695=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L856] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L856] RET 0 assume_abort_if_not(main$tmp_guard0) [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 \read(x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=-1, t1694=0, t1695=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L865] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=-1, t1694=0, t1695=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L869] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L18] 0 __assert_fail ("0", "rfi006_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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - 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: 845]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 852]: 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: 850]: 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, 132 locations, 71 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: 8.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 492 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1121 IncrementalHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 15 mSDtfsCounter, 1121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=13, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-01-10 00:48:27,362 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/rfi006_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 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:48:29,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:48:29,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:48:29,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:48:29,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:48:29,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:48:29,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:48:29,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:48:29,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:48:29,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:48:29,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:48:29,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:48:29,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:48:29,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:48:29,583 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:48:29,583 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:48:29,584 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:48:29,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:48:29,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:48:29,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:48:29,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:48:29,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:29,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:29,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:48:29,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:48:29,585 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 -> 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 [2025-01-10 00:48:29,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:48:29,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:48:29,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:48:29,856 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:48:29,856 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:48:29,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2025-01-10 00:48:31,085 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/307cffaf2/ec4e0abfe9a74faea4a1660deafe7b66/FLAG3954986bf [2025-01-10 00:48:31,350 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:48:31,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2025-01-10 00:48:31,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/307cffaf2/ec4e0abfe9a74faea4a1660deafe7b66/FLAG3954986bf [2025-01-10 00:48:31,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/307cffaf2/ec4e0abfe9a74faea4a1660deafe7b66 [2025-01-10 00:48:31,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:48:31,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:48:31,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:31,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:48:31,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:48:31,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49352d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31, skipping insertion in model container [2025-01-10 00:48:31,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:48:31,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:31,693 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:48:31,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:31,770 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:48:31,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31 WrapperNode [2025-01-10 00:48:31,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:31,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:31,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:48:31,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:48:31,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,824 INFO L138 Inliner]: procedures = 179, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2025-01-10 00:48:31,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:31,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:48:31,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:48:31,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:48:31,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,862 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2025-01-10 00:48:31,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:48:31,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:48:31,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:48:31,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:48:31,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (1/1) ... [2025-01-10 00:48:31,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:31,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:31,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:48:31,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:48:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-10 00:48:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-10 00:48:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:48:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:48:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-10 00:48:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-10 00:48:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:48:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-10 00:48:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-10 00:48:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-10 00:48:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:48:31,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:48:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:48:31,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:48:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:48:31,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:48:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:48:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:48:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:48:31,941 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:48:32,078 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:48:32,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:48:32,587 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:48:32,588 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:48:32,926 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:48:32,926 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:48:32,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:32 BoogieIcfgContainer [2025-01-10 00:48:32,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:48:32,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:48:32,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:48:32,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:48:32,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:48:31" (1/3) ... [2025-01-10 00:48:32,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7647822d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:32, skipping insertion in model container [2025-01-10 00:48:32,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:31" (2/3) ... [2025-01-10 00:48:32,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7647822d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:32, skipping insertion in model container [2025-01-10 00:48:32,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:32" (3/3) ... [2025-01-10 00:48:32,933 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i [2025-01-10 00:48:32,943 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:48:32,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi006_rmo.i that has 4 procedures, 78 locations, 1 initial locations, 0 loop locations, and 38 error locations. [2025-01-10 00:48:32,945 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:48:33,058 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:48:33,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 170 flow [2025-01-10 00:48:33,106 INFO L124 PetriNetUnfolderBase]: 2/76 cut-off events. [2025-01-10 00:48:33,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:33,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 297 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-01-10 00:48:33,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 79 transitions, 170 flow [2025-01-10 00:48:33,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 76 transitions, 161 flow [2025-01-10 00:48:33,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:48:33,124 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;@6ae49efa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:48:33,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-01-10 00:48:33,128 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:48:33,128 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 00:48:33,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:33,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:33,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:48:33,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:33,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash 21865930, now seen corresponding path program 1 times [2025-01-10 00:48:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:33,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225089188] [2025-01-10 00:48:33,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:33,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:33,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:33,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:33,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:48:33,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:48:33,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:48:33,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:33,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:33,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:48:33,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:33,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:33,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:33,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225089188] [2025-01-10 00:48:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225089188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:33,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392583457] [2025-01-10 00:48:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:33,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:33,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:33,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:33,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:33,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:33,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:33,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:33,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:34,122 INFO L124 PetriNetUnfolderBase]: 3375/5456 cut-off events. [2025-01-10 00:48:34,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:34,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10375 conditions, 5456 events. 3375/5456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 42027 event pairs, 3375 based on Foata normal form. 224/3842 useless extension candidates. Maximal degree in co-relation 10364. Up to 4872 conditions per place. [2025-01-10 00:48:34,153 INFO L140 encePairwiseOnDemand]: 49/79 looper letters, 29 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2025-01-10 00:48:34,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 161 flow [2025-01-10 00:48:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-01-10 00:48:34,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2025-01-10 00:48:34,162 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 3 states and 116 transitions. [2025-01-10 00:48:34,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 161 flow [2025-01-10 00:48:34,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:34,167 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 100 flow [2025-01-10 00:48:34,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2025-01-10 00:48:34,171 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2025-01-10 00:48:34,171 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 100 flow [2025-01-10 00:48:34,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:34,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:34,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:48:34,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:48:34,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:34,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:34,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash 21865931, now seen corresponding path program 1 times [2025-01-10 00:48:34,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:34,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675556095] [2025-01-10 00:48:34,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:34,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:34,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:34,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:34,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:48:34,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:48:34,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:48:34,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:34,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:34,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:48:34,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:34,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:34,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:34,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675556095] [2025-01-10 00:48:34,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675556095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:34,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:34,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287161658] [2025-01-10 00:48:34,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:34,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:34,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:34,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:34,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:34,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:34,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:34,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:34,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:34,715 INFO L124 PetriNetUnfolderBase]: 818/1456 cut-off events. [2025-01-10 00:48:34,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:34,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1456 events. 818/1456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9798 event pairs, 818 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 2719. Up to 1239 conditions per place. [2025-01-10 00:48:34,722 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 21 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-01-10 00:48:34,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 132 flow [2025-01-10 00:48:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 00:48:34,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3670886075949367 [2025-01-10 00:48:34,723 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 100 flow. Second operand 3 states and 87 transitions. [2025-01-10 00:48:34,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 132 flow [2025-01-10 00:48:34,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:34,724 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2025-01-10 00:48:34,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:34,725 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places. [2025-01-10 00:48:34,725 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2025-01-10 00:48:34,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:34,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:34,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:34,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:48:34,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:34,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:34,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:34,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1930315950, now seen corresponding path program 1 times [2025-01-10 00:48:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:34,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743260818] [2025-01-10 00:48:34,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:34,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:34,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:34,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:34,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:48:35,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:48:35,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:48:35,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:35,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:35,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:48:35,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:35,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:35,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743260818] [2025-01-10 00:48:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743260818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:35,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:35,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331301015] [2025-01-10 00:48:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:35,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:35,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:35,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:35,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:35,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:35,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:35,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:35,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:35,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:35,265 INFO L124 PetriNetUnfolderBase]: 685/1362 cut-off events. [2025-01-10 00:48:35,266 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:35,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1362 events. 685/1362 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8980 event pairs, 253 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 2432. Up to 813 conditions per place. [2025-01-10 00:48:35,273 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 36 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-01-10 00:48:35,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 197 flow [2025-01-10 00:48:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-01-10 00:48:35,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4092827004219409 [2025-01-10 00:48:35,274 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 97 transitions. [2025-01-10 00:48:35,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 197 flow [2025-01-10 00:48:35,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:35,275 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-01-10 00:48:35,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:35,276 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2025-01-10 00:48:35,276 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-01-10 00:48:35,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:35,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:35,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:35,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:48:35,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:35,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:35,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:35,482 INFO L85 PathProgramCache]: Analyzing trace with hash -392161599, now seen corresponding path program 1 times [2025-01-10 00:48:35,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:35,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1586583933] [2025-01-10 00:48:35,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:35,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:35,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:35,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:48:35,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:48:35,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:48:35,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:35,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:35,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:48:35,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:35,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:35,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:35,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586583933] [2025-01-10 00:48:35,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586583933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:35,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:35,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:48:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127584804] [2025-01-10 00:48:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:35,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:35,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:35,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:35,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:35,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:35,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:35,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:35,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:35,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:35,912 INFO L124 PetriNetUnfolderBase]: 639/1292 cut-off events. [2025-01-10 00:48:35,912 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-01-10 00:48:35,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 1292 events. 639/1292 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8433 event pairs, 225 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 2524. Up to 742 conditions per place. [2025-01-10 00:48:35,919 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 35 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-01-10 00:48:35,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 200 flow [2025-01-10 00:48:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-01-10 00:48:35,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36075949367088606 [2025-01-10 00:48:35,921 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 114 transitions. [2025-01-10 00:48:35,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 200 flow [2025-01-10 00:48:35,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:35,922 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-01-10 00:48:35,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:35,923 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2025-01-10 00:48:35,923 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-01-10 00:48:35,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:35,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:35,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:35,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:48:36,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:36,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:36,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash -392161598, now seen corresponding path program 1 times [2025-01-10 00:48:36,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:36,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791209450] [2025-01-10 00:48:36,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:36,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:36,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:36,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:36,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:48:36,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:48:36,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:48:36,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:36,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:36,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:48:36,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:36,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:36,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:36,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791209450] [2025-01-10 00:48:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791209450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:36,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:36,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:48:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906608904] [2025-01-10 00:48:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:36,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:36,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:36,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:36,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2025-01-10 00:48:36,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:36,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:36,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2025-01-10 00:48:36,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:36,499 INFO L124 PetriNetUnfolderBase]: 593/1290 cut-off events. [2025-01-10 00:48:36,499 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-01-10 00:48:36,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1290 events. 593/1290 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9079 event pairs, 129 based on Foata normal form. 24/1308 useless extension candidates. Maximal degree in co-relation 2428. Up to 672 conditions per place. [2025-01-10 00:48:36,505 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-01-10 00:48:36,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2025-01-10 00:48:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-01-10 00:48:36,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3575949367088608 [2025-01-10 00:48:36,506 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 113 transitions. [2025-01-10 00:48:36,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2025-01-10 00:48:36,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 189 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:36,507 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-01-10 00:48:36,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:36,508 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places. [2025-01-10 00:48:36,508 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-01-10 00:48:36,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:36,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:36,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:36,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:48:36,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:36,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:36,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1033367434, now seen corresponding path program 1 times [2025-01-10 00:48:36,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:36,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998687258] [2025-01-10 00:48:36,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:36,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:36,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:36,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:36,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:48:36,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:48:36,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:48:36,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:36,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:36,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:48:36,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:36,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:36,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998687258] [2025-01-10 00:48:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998687258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:36,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:36,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560422904] [2025-01-10 00:48:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:36,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:36,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:36,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:36,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 79 [2025-01-10 00:48:36,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:36,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:36,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 79 [2025-01-10 00:48:36,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:36,936 INFO L124 PetriNetUnfolderBase]: 593/1087 cut-off events. [2025-01-10 00:48:36,936 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-01-10 00:48:36,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 1087 events. 593/1087 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7028 event pairs, 593 based on Foata normal form. 36/1107 useless extension candidates. Maximal degree in co-relation 2225. Up to 906 conditions per place. [2025-01-10 00:48:36,941 INFO L140 encePairwiseOnDemand]: 77/79 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-01-10 00:48:36,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 123 flow [2025-01-10 00:48:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-01-10 00:48:36,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31645569620253167 [2025-01-10 00:48:36,942 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 75 transitions. [2025-01-10 00:48:36,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 123 flow [2025-01-10 00:48:36,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:36,943 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-01-10 00:48:36,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:36,943 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -36 predicate places. [2025-01-10 00:48:36,944 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-01-10 00:48:36,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:36,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:36,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:36,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:48:37,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:37,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:37,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1033366643, now seen corresponding path program 1 times [2025-01-10 00:48:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137037211] [2025-01-10 00:48:37,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:37,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:37,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:37,148 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:37,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:48:37,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:48:37,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:48:37,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:37,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:37,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:48:37,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:37,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:37,317 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:37,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137037211] [2025-01-10 00:48:37,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137037211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:37,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:37,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:48:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550303267] [2025-01-10 00:48:37,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:37,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:37,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:37,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:37,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2025-01-10 00:48:37,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:37,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:37,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2025-01-10 00:48:37,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:37,890 INFO L124 PetriNetUnfolderBase]: 1347/2255 cut-off events. [2025-01-10 00:48:37,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:37,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 2255 events. 1347/2255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13658 event pairs, 141 based on Foata normal form. 80/2326 useless extension candidates. Maximal degree in co-relation 4639. Up to 1297 conditions per place. [2025-01-10 00:48:37,905 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2025-01-10 00:48:37,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 226 flow [2025-01-10 00:48:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-01-10 00:48:37,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34177215189873417 [2025-01-10 00:48:37,908 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 108 transitions. [2025-01-10 00:48:37,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 226 flow [2025-01-10 00:48:37,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:37,910 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2025-01-10 00:48:37,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:37,911 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -33 predicate places. [2025-01-10 00:48:37,911 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2025-01-10 00:48:37,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:37,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:37,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:37,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:48:38,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:38,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:38,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1729902639, now seen corresponding path program 1 times [2025-01-10 00:48:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:38,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127286204] [2025-01-10 00:48:38,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:38,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:38,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:38,116 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:38,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:48:38,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:48:38,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:48:38,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:38,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:38,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:48:38,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:38,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:38,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127286204] [2025-01-10 00:48:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127286204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:38,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:38,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145784701] [2025-01-10 00:48:38,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:38,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:38,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:38,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:38,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2025-01-10 00:48:38,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-01-10 00:48:38,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:38,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2025-01-10 00:48:38,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:38,447 INFO L124 PetriNetUnfolderBase]: 863/1471 cut-off events. [2025-01-10 00:48:38,447 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2025-01-10 00:48:38,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 1471 events. 863/1471 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7831 event pairs, 67 based on Foata normal form. 68/1530 useless extension candidates. Maximal degree in co-relation 3527. Up to 625 conditions per place. [2025-01-10 00:48:38,453 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2025-01-10 00:48:38,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 324 flow [2025-01-10 00:48:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:48:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:48:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-01-10 00:48:38,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34430379746835443 [2025-01-10 00:48:38,454 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 136 transitions. [2025-01-10 00:48:38,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 324 flow [2025-01-10 00:48:38,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 314 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:38,456 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2025-01-10 00:48:38,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:38,456 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2025-01-10 00:48:38,456 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2025-01-10 00:48:38,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-01-10 00:48:38,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:38,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:38,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 00:48:38,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:38,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:38,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2141221005, now seen corresponding path program 1 times [2025-01-10 00:48:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781842064] [2025-01-10 00:48:38,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:38,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:38,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:38,660 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:38,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:48:38,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:48:38,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:48:38,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:38,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:38,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:48:38,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:38,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:38,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781842064] [2025-01-10 00:48:38,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781842064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:38,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:38,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:48:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101409007] [2025-01-10 00:48:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:38,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:48:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:38,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:48:38,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:48:38,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2025-01-10 00:48:38,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:38,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:38,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2025-01-10 00:48:38,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:38,998 INFO L124 PetriNetUnfolderBase]: 475/799 cut-off events. [2025-01-10 00:48:38,999 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2025-01-10 00:48:39,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 799 events. 475/799 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3426 event pairs, 53 based on Foata normal form. 36/826 useless extension candidates. Maximal degree in co-relation 2193. Up to 268 conditions per place. [2025-01-10 00:48:39,002 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2025-01-10 00:48:39,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 333 flow [2025-01-10 00:48:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:48:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:48:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-01-10 00:48:39,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31223628691983124 [2025-01-10 00:48:39,003 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 148 transitions. [2025-01-10 00:48:39,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 333 flow [2025-01-10 00:48:39,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 308 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 00:48:39,006 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2025-01-10 00:48:39,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, 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-01-10 00:48:39,006 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -26 predicate places. [2025-01-10 00:48:39,006 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2025-01-10 00:48:39,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:39,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:39,007 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-01-10 00:48:39,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:48:39,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:39,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:39,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1501637182, now seen corresponding path program 1 times [2025-01-10 00:48:39,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:39,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248259633] [2025-01-10 00:48:39,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:39,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:39,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:39,215 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:39,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:48:39,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:39,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:39,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:39,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:39,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:48:39,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:39,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:39,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:39,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248259633] [2025-01-10 00:48:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248259633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:39,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:39,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:48:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518644321] [2025-01-10 00:48:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:39,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:48:39,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:39,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:48:39,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:48:39,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 79 [2025-01-10 00:48:39,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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-01-10 00:48:39,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:39,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 79 [2025-01-10 00:48:39,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:39,581 INFO L124 PetriNetUnfolderBase]: 605/1172 cut-off events. [2025-01-10 00:48:39,581 INFO L125 PetriNetUnfolderBase]: For 553/564 co-relation queries the response was YES. [2025-01-10 00:48:39,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 1172 events. 605/1172 cut-off events. For 553/564 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6504 event pairs, 282 based on Foata normal form. 8/1136 useless extension candidates. Maximal degree in co-relation 2814. Up to 538 conditions per place. [2025-01-10 00:48:39,586 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 29 selfloop transitions, 2 changer transitions 17/66 dead transitions. [2025-01-10 00:48:39,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 331 flow [2025-01-10 00:48:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:48:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:48:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-10 00:48:39,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3059071729957806 [2025-01-10 00:48:39,588 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 6 states and 145 transitions. [2025-01-10 00:48:39,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 331 flow [2025-01-10 00:48:39,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 264 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-01-10 00:48:39,591 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 125 flow [2025-01-10 00:48:39,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2025-01-10 00:48:39,592 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -25 predicate places. [2025-01-10 00:48:39,592 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 125 flow [2025-01-10 00:48:39,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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-01-10 00:48:39,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:39,592 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-01-10 00:48:39,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:48:39,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:39,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-01-10 00:48:39,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1787760108, now seen corresponding path program 2 times [2025-01-10 00:48:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2086210364] [2025-01-10 00:48:39,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:48:39,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:39,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:39,800 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:39,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 00:48:39,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:39,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:39,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:48:39,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:39,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:48:39,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:39,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:39,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:39,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:40,018 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:48:40,018 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:48:40,019 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2025-01-10 00:48:40,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2025-01-10 00:48:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2025-01-10 00:48:40,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (33 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2025-01-10 00:48:40,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2025-01-10 00:48:40,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 00:48:40,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:40,226 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:40,313 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:48:40,314 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:48:40,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:48:40 BasicIcfg [2025-01-10 00:48:40,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:48:40,319 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:48:40,319 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:48:40,320 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:48:40,320 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:32" (3/4) ... [2025-01-10 00:48:40,321 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:48:40,322 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:48:40,322 INFO L158 Benchmark]: Toolchain (without parser) took 8939.05ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 89.2MB in the beginning and 220.1MB in the end (delta: -130.9MB). Peak memory consumption was 276.6MB. Max. memory is 16.1GB. [2025-01-10 00:48:40,322 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory was 53.8MB in the beginning and 53.8MB in the end (delta: 17.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:40,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.07ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 64.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:48:40,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.25ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 62.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:40,323 INFO L158 Benchmark]: Boogie Preprocessor took 57.65ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 59.0MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:48:40,324 INFO L158 Benchmark]: RCFGBuilder took 1041.15ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 59.0MB in the beginning and 78.5MB in the end (delta: -19.4MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2025-01-10 00:48:40,324 INFO L158 Benchmark]: TraceAbstraction took 7390.96ms. Allocated memory was 159.4MB in the beginning and 520.1MB in the end (delta: 360.7MB). Free memory was 78.5MB in the beginning and 220.2MB in the end (delta: -141.7MB). Peak memory consumption was 226.3MB. Max. memory is 16.1GB. [2025-01-10 00:48:40,324 INFO L158 Benchmark]: Witness Printer took 2.25ms. Allocated memory is still 520.1MB. Free memory was 220.2MB in the beginning and 220.1MB in the end (delta: 50.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:40,325 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.27ms. Allocated memory is still 83.9MB. Free memory was 53.8MB in the beginning and 53.8MB in the end (delta: 17.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.07ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 64.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.25ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 62.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.65ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 59.0MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1041.15ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 59.0MB in the beginning and 78.5MB in the end (delta: -19.4MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7390.96ms. Allocated memory was 159.4MB in the beginning and 520.1MB in the end (delta: 360.7MB). Free memory was 78.5MB in the beginning and 220.2MB in the end (delta: -141.7MB). Peak memory consumption was 226.3MB. Max. memory is 16.1GB. * Witness Printer took 2.25ms. Allocated memory is still 520.1MB. Free memory was 220.2MB in the beginning and 220.1MB in the end (delta: 50.3kB). 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_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L847] 0 pthread_t t1693; [L848] FCALL, FORK 0 pthread_create(&t1693, ((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_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1693=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 \read(x) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L774] EXPR 1 \read(x) [L774] 1 __unbuffered_p0_EAX = x [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] EXPR 1 \read(x) [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] 1 x = x$flush_delayed ? x$mem_tmp : x [L776] 1 x$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_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L849] 0 pthread_t t1694; [L850] FCALL, FORK 0 pthread_create(&t1694, ((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_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1693=-2, t1694=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1695; [L779] 1 y = 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_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L791] 2 y = 2 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_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L794] 2 __unbuffered_p1_EAX = y 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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L797] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 2 x$flush_delayed = weak$$choice2 [L800] EXPR 2 \read(x) [L800] 2 x$mem_tmp = x [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] EXPR 2 \read(x) [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 \read(x) [L808] 2 __unbuffered_p1_EBX = x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] 2 x = x$flush_delayed ? x$mem_tmp : x [L810] 2 x$flush_delayed = (_Bool)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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] FCALL, FORK 0 pthread_create(&t1695, ((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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1693=-2, t1694=-1, t1695=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L822] 3 x = 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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L815] 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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L832] 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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L854] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=-2, t1694=-1, t1695=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L856] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L856] RET 0 assume_abort_if_not(main$tmp_guard0) [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 \read(x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=-2, t1694=-1, t1695=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L865] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=-2, t1694=-1, t1695=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L869] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L18] 0 __assert_fail ("0", "rfi006_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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - 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: 845]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 852]: 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: 850]: 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, 132 locations, 71 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: 7.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 337 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 713 IncrementalHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 6 mSDtfsCounter, 713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=9, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 607 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1215 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:48:40,343 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