./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe020_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/safe020_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 d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:51:14,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:51:14,220 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:51:14,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:51:14,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:51:14,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:51:14,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:51:14,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:51:14,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:51:14,246 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:51:14,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:51:14,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:51:14,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:51:14,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:51:14,247 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:51:14,248 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:14,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:14,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:51:14,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:51:14,248 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 -> d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf [2025-01-10 00:51:14,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:51:14,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:51:14,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:51:14,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:51:14,459 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:51:14,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2025-01-10 00:51:15,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9eb4c951b/aec6ceca1bd04eccacc98dcb842c00e7/FLAG56525d00a [2025-01-10 00:51:15,855 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:51:15,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2025-01-10 00:51:15,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9eb4c951b/aec6ceca1bd04eccacc98dcb842c00e7/FLAG56525d00a [2025-01-10 00:51:15,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9eb4c951b/aec6ceca1bd04eccacc98dcb842c00e7 [2025-01-10 00:51:15,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:51:15,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:51:15,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:51:15,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:51:15,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:51:15,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:15" (1/1) ... [2025-01-10 00:51:15,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:15, skipping insertion in model container [2025-01-10 00:51:15,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:15" (1/1) ... [2025-01-10 00:51:15,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:51:16,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:51:16,194 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:51:16,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:51:16,295 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:51:16,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16 WrapperNode [2025-01-10 00:51:16,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:51:16,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:51:16,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:51:16,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:51:16,302 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:51:16" (1/1) ... [2025-01-10 00:51:16,318 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:51:16" (1/1) ... [2025-01-10 00:51:16,342 INFO L138 Inliner]: procedures = 175, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2025-01-10 00:51:16,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:51:16,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:51:16,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:51:16,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:51:16,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,377 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 8 writes are split as follows [0, 8]. [2025-01-10 00:51:16,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,384 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:51:16,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:51:16,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:51:16,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:51:16,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (1/1) ... [2025-01-10 00:51:16,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:16,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:16,436 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:51:16,438 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:51:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:51:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:51:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:51:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:51:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:51:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:51:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:51:16,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:51:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:51:16,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:51:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:51:16,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:51:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:51:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:51:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:51:16,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:51:16,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:51:16,462 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:51:16,587 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:51:16,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:51:17,020 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:51:17,021 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:51:17,412 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:51:17,412 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:51:17,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:17 BoogieIcfgContainer [2025-01-10 00:51:17,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:51:17,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:51:17,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:51:17,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:51:17,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:51:15" (1/3) ... [2025-01-10 00:51:17,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b12798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:17, skipping insertion in model container [2025-01-10 00:51:17,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:16" (2/3) ... [2025-01-10 00:51:17,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b12798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:17, skipping insertion in model container [2025-01-10 00:51:17,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:17" (3/3) ... [2025-01-10 00:51:17,420 INFO L128 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2025-01-10 00:51:17,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:51:17,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe020_rmo.i that has 4 procedures, 82 locations, 1 initial locations, 0 loop locations, and 42 error locations. [2025-01-10 00:51:17,438 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:51:17,555 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:51:17,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 83 transitions, 178 flow [2025-01-10 00:51:17,619 INFO L124 PetriNetUnfolderBase]: 2/80 cut-off events. [2025-01-10 00:51:17,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:17,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 339 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2025-01-10 00:51:17,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 83 transitions, 178 flow [2025-01-10 00:51:17,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 80 transitions, 169 flow [2025-01-10 00:51:17,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:51:17,652 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;@77a4f77a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:51:17,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-01-10 00:51:17,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:51:17,660 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 00:51:17,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:17,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:17,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:51:17,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:17,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:17,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1683561820, now seen corresponding path program 1 times [2025-01-10 00:51:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466238367] [2025-01-10 00:51:17,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:17,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:17,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:51:17,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:51:17,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:17,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:17,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:17,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466238367] [2025-01-10 00:51:17,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466238367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:17,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:17,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030421615] [2025-01-10 00:51:17,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:17,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:17,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:17,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:17,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:17,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:18,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:51:18,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:18,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:18,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:19,355 INFO L124 PetriNetUnfolderBase]: 6180/9798 cut-off events. [2025-01-10 00:51:19,355 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:51:19,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18662 conditions, 9798 events. 6180/9798 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 80523 event pairs, 6180 based on Foata normal form. 392/6392 useless extension candidates. Maximal degree in co-relation 18651. Up to 8793 conditions per place. [2025-01-10 00:51:19,425 INFO L140 encePairwiseOnDemand]: 51/83 looper letters, 32 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-01-10 00:51:19,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 171 flow [2025-01-10 00:51:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-01-10 00:51:19,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4738955823293173 [2025-01-10 00:51:19,439 INFO L175 Difference]: Start difference. First operand has 88 places, 80 transitions, 169 flow. Second operand 3 states and 118 transitions. [2025-01-10 00:51:19,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 171 flow [2025-01-10 00:51:19,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:51:19,446 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 104 flow [2025-01-10 00:51:19,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-01-10 00:51:19,453 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -31 predicate places. [2025-01-10 00:51:19,453 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 104 flow [2025-01-10 00:51:19,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:51:19,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:19,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:51:19,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:51:19,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:19,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1683435513, now seen corresponding path program 1 times [2025-01-10 00:51:19,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:19,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512782483] [2025-01-10 00:51:19,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:19,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:51:19,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:51:19,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:19,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:19,593 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:51:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512782483] [2025-01-10 00:51:19,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512782483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:19,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:19,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:19,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182856883] [2025-01-10 00:51:19,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:19,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:19,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:19,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:19,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:19,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:19,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:19,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:19,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:19,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:19,984 INFO L124 PetriNetUnfolderBase]: 1135/1978 cut-off events. [2025-01-10 00:51:19,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:19,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 1978 events. 1135/1978 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13597 event pairs, 1135 based on Foata normal form. 0/1838 useless extension candidates. Maximal degree in co-relation 3702. Up to 1694 conditions per place. [2025-01-10 00:51:19,997 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-01-10 00:51:19,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 134 flow [2025-01-10 00:51:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 00:51:20,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3493975903614458 [2025-01-10 00:51:20,000 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 104 flow. Second operand 3 states and 87 transitions. [2025-01-10 00:51:20,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 134 flow [2025-01-10 00:51:20,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:51:20,001 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2025-01-10 00:51:20,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:20,002 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -39 predicate places. [2025-01-10 00:51:20,002 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2025-01-10 00:51:20,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:20,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:20,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:20,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:51:20,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:20,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1815438081, now seen corresponding path program 1 times [2025-01-10 00:51:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:20,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143311836] [2025-01-10 00:51:20,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:20,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:51:20,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:51:20,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:20,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:20,155 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:51:20,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143311836] [2025-01-10 00:51:20,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143311836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:20,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:20,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:20,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141263998] [2025-01-10 00:51:20,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:20,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:20,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:20,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:20,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:20,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:20,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:51:20,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:20,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:20,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:20,375 INFO L124 PetriNetUnfolderBase]: 973/1735 cut-off events. [2025-01-10 00:51:20,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:20,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3232 conditions, 1735 events. 973/1735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11376 event pairs, 211 based on Foata normal form. 0/1646 useless extension candidates. Maximal degree in co-relation 3225. Up to 1171 conditions per place. [2025-01-10 00:51:20,384 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 33 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-01-10 00:51:20,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 179 flow [2025-01-10 00:51:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-01-10 00:51:20,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3654618473895582 [2025-01-10 00:51:20,385 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 91 transitions. [2025-01-10 00:51:20,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 179 flow [2025-01-10 00:51:20,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:51:20,387 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-01-10 00:51:20,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:20,387 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -38 predicate places. [2025-01-10 00:51:20,387 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-01-10 00:51:20,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:51:20,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:20,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:20,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:51:20,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:20,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash 879359700, now seen corresponding path program 1 times [2025-01-10 00:51:20,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549651206] [2025-01-10 00:51:20,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:20,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:51:20,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:51:20,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:20,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:20,502 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:51:20,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:20,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549651206] [2025-01-10 00:51:20,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549651206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:20,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:20,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:51:20,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505048601] [2025-01-10 00:51:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:20,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:51:20,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:20,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:51:20,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:51:20,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:20,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:20,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:20,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:20,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:20,782 INFO L124 PetriNetUnfolderBase]: 898/1624 cut-off events. [2025-01-10 00:51:20,782 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-01-10 00:51:20,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1624 events. 898/1624 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10584 event pairs, 187 based on Foata normal form. 0/1607 useless extension candidates. Maximal degree in co-relation 3231. Up to 1059 conditions per place. [2025-01-10 00:51:20,791 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 32 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-01-10 00:51:20,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 182 flow [2025-01-10 00:51:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:51:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:51:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-01-10 00:51:20,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32228915662650603 [2025-01-10 00:51:20,792 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 107 transitions. [2025-01-10 00:51:20,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 182 flow [2025-01-10 00:51:20,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:51:20,794 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-01-10 00:51:20,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:20,794 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -38 predicate places. [2025-01-10 00:51:20,794 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-01-10 00:51:20,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:20,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:20,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:20,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:51:20,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:20,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash 879359701, now seen corresponding path program 1 times [2025-01-10 00:51:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:20,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914461809] [2025-01-10 00:51:20,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:20,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:51:20,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:51:20,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:20,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:21,106 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:51:21,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914461809] [2025-01-10 00:51:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914461809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:51:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234348608] [2025-01-10 00:51:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:51:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:21,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:51:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:51:21,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:21,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:21,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:21,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:21,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:21,338 INFO L124 PetriNetUnfolderBase]: 823/1513 cut-off events. [2025-01-10 00:51:21,338 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-01-10 00:51:21,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 1513 events. 823/1513 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9815 event pairs, 163 based on Foata normal form. 36/1532 useless extension candidates. Maximal degree in co-relation 2973. Up to 948 conditions per place. [2025-01-10 00:51:21,344 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-01-10 00:51:21,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 176 flow [2025-01-10 00:51:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:51:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:51:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-01-10 00:51:21,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3192771084337349 [2025-01-10 00:51:21,345 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 106 transitions. [2025-01-10 00:51:21,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 176 flow [2025-01-10 00:51:21,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 171 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:51:21,346 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-01-10 00:51:21,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:21,347 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -39 predicate places. [2025-01-10 00:51:21,347 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-01-10 00:51:21,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:21,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:21,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:21,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:51:21,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:21,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1102651655, now seen corresponding path program 1 times [2025-01-10 00:51:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112988466] [2025-01-10 00:51:21,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:21,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:51:21,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:51:21,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:21,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:21,397 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:51:21,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112988466] [2025-01-10 00:51:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112988466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:21,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:21,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732812716] [2025-01-10 00:51:21,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:21,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:21,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:21,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 83 [2025-01-10 00:51:21,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:51:21,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:21,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 83 [2025-01-10 00:51:21,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:21,574 INFO L124 PetriNetUnfolderBase]: 823/1474 cut-off events. [2025-01-10 00:51:21,574 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-01-10 00:51:21,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2942 conditions, 1474 events. 823/1474 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9870 event pairs, 823 based on Foata normal form. 48/1478 useless extension candidates. Maximal degree in co-relation 2934. Up to 1238 conditions per place. [2025-01-10 00:51:21,579 INFO L140 encePairwiseOnDemand]: 81/83 looper letters, 19 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-01-10 00:51:21,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 125 flow [2025-01-10 00:51:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 00:51:21,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2931726907630522 [2025-01-10 00:51:21,580 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 73 transitions. [2025-01-10 00:51:21,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 125 flow [2025-01-10 00:51:21,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:51:21,581 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-01-10 00:51:21,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:21,581 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -40 predicate places. [2025-01-10 00:51:21,581 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-01-10 00:51:21,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:51:21,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:21,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:21,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:51:21,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:21,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1102653027, now seen corresponding path program 1 times [2025-01-10 00:51:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139879112] [2025-01-10 00:51:21,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:21,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:51:21,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:51:21,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:21,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:21,707 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:51:21,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:21,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139879112] [2025-01-10 00:51:21,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139879112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:21,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:21,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:51:21,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213947082] [2025-01-10 00:51:21,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:21,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:51:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:21,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:51:21,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:51:21,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2025-01-10 00:51:21,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:21,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:21,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2025-01-10 00:51:21,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:22,034 INFO L124 PetriNetUnfolderBase]: 1678/2779 cut-off events. [2025-01-10 00:51:22,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:22,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5642 conditions, 2779 events. 1678/2779 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16976 event pairs, 186 based on Foata normal form. 100/2863 useless extension candidates. Maximal degree in co-relation 5634. Up to 1579 conditions per place. [2025-01-10 00:51:22,043 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 43 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2025-01-10 00:51:22,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 236 flow [2025-01-10 00:51:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:51:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:51:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-01-10 00:51:22,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32228915662650603 [2025-01-10 00:51:22,044 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 107 transitions. [2025-01-10 00:51:22,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 236 flow [2025-01-10 00:51:22,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:51:22,045 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2025-01-10 00:51:22,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:22,046 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -37 predicate places. [2025-01-10 00:51:22,046 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2025-01-10 00:51:22,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:22,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:22,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] [2025-01-10 00:51:22,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:51:22,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:22,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2058479291, now seen corresponding path program 1 times [2025-01-10 00:51:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:22,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079467989] [2025-01-10 00:51:22,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:22,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:51:22,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:51:22,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:22,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:22,260 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:51:22,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:22,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079467989] [2025-01-10 00:51:22,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079467989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:22,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:22,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:51:22,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663705047] [2025-01-10 00:51:22,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:22,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:51:22,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:22,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:51:22,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:51:22,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2025-01-10 00:51:22,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:51:22,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:22,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2025-01-10 00:51:22,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:22,637 INFO L124 PetriNetUnfolderBase]: 1036/1741 cut-off events. [2025-01-10 00:51:22,637 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2025-01-10 00:51:22,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4127 conditions, 1741 events. 1036/1741 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9287 event pairs, 98 based on Foata normal form. 82/1807 useless extension candidates. Maximal degree in co-relation 4116. Up to 697 conditions per place. [2025-01-10 00:51:22,645 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 54 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2025-01-10 00:51:22,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 338 flow [2025-01-10 00:51:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:51:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:51:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-10 00:51:22,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3253012048192771 [2025-01-10 00:51:22,647 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 135 transitions. [2025-01-10 00:51:22,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 338 flow [2025-01-10 00:51:22,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:51:22,651 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2025-01-10 00:51:22,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:22,653 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -33 predicate places. [2025-01-10 00:51:22,654 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2025-01-10 00:51:22,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:51:22,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:22,655 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:51:22,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:51:22,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:22,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1505717911, now seen corresponding path program 1 times [2025-01-10 00:51:22,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:22,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586486342] [2025-01-10 00:51:22,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:22,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:22,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:51:22,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:51:22,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:22,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:23,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:23,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586486342] [2025-01-10 00:51:23,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586486342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:23,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:23,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:51:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645884224] [2025-01-10 00:51:23,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:23,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:51:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:23,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:51:23,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:51:23,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2025-01-10 00:51:23,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:51:23,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:23,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2025-01-10 00:51:23,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:23,287 INFO L124 PetriNetUnfolderBase]: 579/954 cut-off events. [2025-01-10 00:51:23,287 INFO L125 PetriNetUnfolderBase]: For 744/744 co-relation queries the response was YES. [2025-01-10 00:51:23,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2573 conditions, 954 events. 579/954 cut-off events. For 744/744 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4241 event pairs, 81 based on Foata normal form. 40/978 useless extension candidates. Maximal degree in co-relation 2560. Up to 308 conditions per place. [2025-01-10 00:51:23,291 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 47 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2025-01-10 00:51:23,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 343 flow [2025-01-10 00:51:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:51:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:51:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-10 00:51:23,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29116465863453816 [2025-01-10 00:51:23,292 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 145 transitions. [2025-01-10 00:51:23,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 343 flow [2025-01-10 00:51:23,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 318 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 00:51:23,296 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2025-01-10 00:51:23,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:23,296 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -30 predicate places. [2025-01-10 00:51:23,296 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2025-01-10 00:51:23,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:51:23,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:23,297 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:51:23,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:51:23,297 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:23,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1760174166, now seen corresponding path program 1 times [2025-01-10 00:51:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:23,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799816381] [2025-01-10 00:51:23,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:23,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:23,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:51:23,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:23,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:23,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:23,596 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:51:23,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799816381] [2025-01-10 00:51:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799816381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:51:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836819301] [2025-01-10 00:51:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:23,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:51:23,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:23,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:51:23,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:51:23,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 83 [2025-01-10 00:51:23,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:23,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:23,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 83 [2025-01-10 00:51:23,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:23,809 INFO L124 PetriNetUnfolderBase]: 674/1279 cut-off events. [2025-01-10 00:51:23,810 INFO L125 PetriNetUnfolderBase]: For 579/593 co-relation queries the response was YES. [2025-01-10 00:51:23,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3011 conditions, 1279 events. 674/1279 cut-off events. For 579/593 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7154 event pairs, 313 based on Foata normal form. 8/1239 useless extension candidates. Maximal degree in co-relation 2997. Up to 619 conditions per place. [2025-01-10 00:51:23,813 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 26 selfloop transitions, 2 changer transitions 13/59 dead transitions. [2025-01-10 00:51:23,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 295 flow [2025-01-10 00:51:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:51:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:51:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-01-10 00:51:23,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29397590361445786 [2025-01-10 00:51:23,815 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 5 states and 122 transitions. [2025-01-10 00:51:23,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 295 flow [2025-01-10 00:51:23,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 231 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-01-10 00:51:23,819 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 123 flow [2025-01-10 00:51:23,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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=5, PETRI_FLOW=123, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2025-01-10 00:51:23,819 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -31 predicate places. [2025-01-10 00:51:23,819 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 123 flow [2025-01-10 00:51:23,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:23,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:23,819 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:51:23,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:51:23,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:23,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:23,820 INFO L85 PathProgramCache]: Analyzing trace with hash -24538038, now seen corresponding path program 2 times [2025-01-10 00:51:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:23,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268711083] [2025-01-10 00:51:23,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:51:23,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:23,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:51:23,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:23,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:51:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:25,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:51:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268711083] [2025-01-10 00:51:25,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268711083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:25,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:25,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:51:25,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693837010] [2025-01-10 00:51:25,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:25,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:51:25,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:51:25,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:51:25,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:51:25,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:25,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 123 flow. Second operand has 10 states, 10 states have (on average 19.7) internal successors, (197), 10 states have internal predecessors, (197), 0 states have call successors, (0), 0 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:51:25,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:25,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:25,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:26,167 INFO L124 PetriNetUnfolderBase]: 372/736 cut-off events. [2025-01-10 00:51:26,167 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 00:51:26,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 736 events. 372/736 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3548 event pairs, 70 based on Foata normal form. 8/695 useless extension candidates. Maximal degree in co-relation 1476. Up to 229 conditions per place. [2025-01-10 00:51:26,169 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 22 selfloop transitions, 3 changer transitions 23/68 dead transitions. [2025-01-10 00:51:26,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 283 flow [2025-01-10 00:51:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:51:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:51:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2025-01-10 00:51:26,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29066265060240964 [2025-01-10 00:51:26,170 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 123 flow. Second operand 8 states and 193 transitions. [2025-01-10 00:51:26,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 283 flow [2025-01-10 00:51:26,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 269 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:51:26,172 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 129 flow [2025-01-10 00:51:26,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=129, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2025-01-10 00:51:26,172 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -26 predicate places. [2025-01-10 00:51:26,172 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 129 flow [2025-01-10 00:51:26,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.7) internal successors, (197), 10 states have internal predecessors, (197), 0 states have call successors, (0), 0 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:51:26,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:26,173 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:51:26,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:51:26,173 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:26,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:26,173 INFO L85 PathProgramCache]: Analyzing trace with hash 868344560, now seen corresponding path program 3 times [2025-01-10 00:51:26,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:51:26,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102507551] [2025-01-10 00:51:26,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:51:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:51:26,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:51:26,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:26,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:51:26,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:51:26,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:51:26,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:51:26,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:26,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:26,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:51:26,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:51:26,385 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:51:26,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (78 of 79 remaining) [2025-01-10 00:51:26,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 79 remaining) [2025-01-10 00:51:26,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 79 remaining) [2025-01-10 00:51:26,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 79 remaining) [2025-01-10 00:51:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 79 remaining) [2025-01-10 00:51:26,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 79 remaining) [2025-01-10 00:51:26,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 79 remaining) [2025-01-10 00:51:26,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 79 remaining) [2025-01-10 00:51:26,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 79 remaining) [2025-01-10 00:51:26,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 79 remaining) [2025-01-10 00:51:26,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 79 remaining) [2025-01-10 00:51:26,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 79 remaining) [2025-01-10 00:51:26,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 79 remaining) [2025-01-10 00:51:26,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 79 remaining) [2025-01-10 00:51:26,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 79 remaining) [2025-01-10 00:51:26,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (37 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 79 remaining) [2025-01-10 00:51:26,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 79 remaining) [2025-01-10 00:51:26,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 79 remaining) [2025-01-10 00:51:26,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 79 remaining) [2025-01-10 00:51:26,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 79 remaining) [2025-01-10 00:51:26,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 79 remaining) [2025-01-10 00:51:26,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:51:26,396 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:26,480 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:51:26,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:51:26,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:51:26 BasicIcfg [2025-01-10 00:51:26,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:51:26,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:51:26,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:51:26,487 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:51:26,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:17" (3/4) ... [2025-01-10 00:51:26,489 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:51:26,489 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:51:26,490 INFO L158 Benchmark]: Toolchain (without parser) took 10595.69ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 956.3MB). Free memory was 104.1MB in the beginning and 924.1MB in the end (delta: -820.0MB). Peak memory consumption was 137.8MB. Max. memory is 16.1GB. [2025-01-10 00:51:26,490 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:26,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.34ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 80.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:51:26,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.38ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 78.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:26,490 INFO L158 Benchmark]: Boogie Preprocessor took 57.99ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 74.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:51:26,490 INFO L158 Benchmark]: RCFGBuilder took 1006.03ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 70.1MB in the end (delta: 4.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2025-01-10 00:51:26,491 INFO L158 Benchmark]: TraceAbstraction took 9071.87ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 956.3MB). Free memory was 70.1MB in the beginning and 924.2MB in the end (delta: -854.1MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2025-01-10 00:51:26,491 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 1.1GB. Free memory was 924.2MB in the beginning and 924.1MB in the end (delta: 148.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:26,493 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.34ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 80.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.38ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 78.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.99ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 74.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1006.03ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 70.1MB in the end (delta: 4.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9071.87ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 956.3MB). Free memory was 70.1MB in the beginning and 924.2MB in the end (delta: -854.1MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 1.1GB. Free memory was 924.2MB in the beginning and 924.1MB in the end (delta: 148.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; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, 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 t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, t2270=-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] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, t2270=-2, t2271=-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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L759] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] 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) [L768] EXPR 1 \read(x) [L768] 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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L827] 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) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] 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) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L789] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269=-3, t2270=-2, t2271=-1, weak$$choice0=1, 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] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269=-3, t2270=-2, t2271=-1, weak$$choice0=1, 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] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269=-3, t2270=-2, t2271=-1, weak$$choice0=1, 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] [L871] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=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", "safe020_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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 79 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.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 398 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 755 IncrementalHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 10 mSDtfsCounter, 755 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=0, InterpolantAutomatonStates: 48, 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.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:51:26,516 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/safe020_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 d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:51:28,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:51:28,693 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:51:28,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:51:28,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:51:28,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:51:28,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:51:28,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:51:28,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:51:28,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:51:28,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:51:28,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:51:28,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:51:28,725 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:51:28,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:28,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:28,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:51:28,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:51:28,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:51:28,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:51:28,727 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 -> d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf [2025-01-10 00:51:28,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:51:28,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:51:28,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:51:28,957 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:51:28,958 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:51:28,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2025-01-10 00:51:30,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa24b23b0/74dfeb92d32e47ddaa799fa1fbecf417/FLAG573f699b7 [2025-01-10 00:51:30,412 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:51:30,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2025-01-10 00:51:30,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa24b23b0/74dfeb92d32e47ddaa799fa1fbecf417/FLAG573f699b7 [2025-01-10 00:51:30,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa24b23b0/74dfeb92d32e47ddaa799fa1fbecf417 [2025-01-10 00:51:30,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:51:30,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:51:30,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:51:30,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:51:30,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:51:30,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:30" (1/1) ... [2025-01-10 00:51:30,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@426caab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:30, skipping insertion in model container [2025-01-10 00:51:30,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:30" (1/1) ... [2025-01-10 00:51:30,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:51:31,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:51:31,038 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:51:31,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:51:31,169 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:51:31,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31 WrapperNode [2025-01-10 00:51:31,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:51:31,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:51:31,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:51:31,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:51:31,176 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:51:31" (1/1) ... [2025-01-10 00:51:31,194 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:51:31" (1/1) ... [2025-01-10 00:51:31,217 INFO L138 Inliner]: procedures = 179, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2025-01-10 00:51:31,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:51:31,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:51:31,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:51:31,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:51:31,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,248 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [21, 2]. 91 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2]. The 8 writes are split as follows [8, 0]. [2025-01-10 00:51:31,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:51:31,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:51:31,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:51:31,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:51:31,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (1/1) ... [2025-01-10 00:51:31,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:31,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:31,293 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:51:31,298 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:51:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-10 00:51:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-10 00:51:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:51:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:51:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-10 00:51:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-10 00:51:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:51:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-10 00:51:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-10 00:51:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-10 00:51:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:51:31,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:51:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:51:31,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:51:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:51:31,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:51:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:51:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:51:31,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:51:31,315 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:51:31,446 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:51:31,448 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:51:31,920 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:51:31,921 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:51:32,304 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:51:32,304 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:51:32,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:32 BoogieIcfgContainer [2025-01-10 00:51:32,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:51:32,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:51:32,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:51:32,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:51:32,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:51:30" (1/3) ... [2025-01-10 00:51:32,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474dc808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:32, skipping insertion in model container [2025-01-10 00:51:32,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:31" (2/3) ... [2025-01-10 00:51:32,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474dc808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:32, skipping insertion in model container [2025-01-10 00:51:32,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:32" (3/3) ... [2025-01-10 00:51:32,313 INFO L128 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2025-01-10 00:51:32,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:51:32,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe020_rmo.i that has 4 procedures, 82 locations, 1 initial locations, 0 loop locations, and 42 error locations. [2025-01-10 00:51:32,327 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:51:32,461 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:51:32,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 83 transitions, 178 flow [2025-01-10 00:51:32,549 INFO L124 PetriNetUnfolderBase]: 2/80 cut-off events. [2025-01-10 00:51:32,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:32,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 327 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2025-01-10 00:51:32,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 83 transitions, 178 flow [2025-01-10 00:51:32,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 80 transitions, 169 flow [2025-01-10 00:51:32,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:51:32,581 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;@492e1cf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:51:32,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-01-10 00:51:32,589 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:51:32,589 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-10 00:51:32,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:32,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:32,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:51:32,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:32,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:32,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1744451388, now seen corresponding path program 1 times [2025-01-10 00:51:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:32,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492503811] [2025-01-10 00:51:32,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:32,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:32,608 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:51:32,609 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:51:32,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:51:32,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:51:32,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:32,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:32,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:51:32,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:32,788 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:51:32,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:32,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492503811] [2025-01-10 00:51:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492503811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:32,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:32,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681710352] [2025-01-10 00:51:32,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:32,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:32,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:32,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:32,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:32,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:32,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:32,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:32,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:32,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:34,289 INFO L124 PetriNetUnfolderBase]: 6180/9798 cut-off events. [2025-01-10 00:51:34,290 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:51:34,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18662 conditions, 9798 events. 6180/9798 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 80352 event pairs, 6180 based on Foata normal form. 392/6392 useless extension candidates. Maximal degree in co-relation 18651. Up to 8793 conditions per place. [2025-01-10 00:51:34,367 INFO L140 encePairwiseOnDemand]: 51/83 looper letters, 32 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-01-10 00:51:34,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 171 flow [2025-01-10 00:51:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:34,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-01-10 00:51:34,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4738955823293173 [2025-01-10 00:51:34,378 INFO L175 Difference]: Start difference. First operand has 88 places, 80 transitions, 169 flow. Second operand 3 states and 118 transitions. [2025-01-10 00:51:34,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 171 flow [2025-01-10 00:51:34,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:51:34,384 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 104 flow [2025-01-10 00:51:34,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-01-10 00:51:34,388 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -31 predicate places. [2025-01-10 00:51:34,388 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 104 flow [2025-01-10 00:51:34,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:34,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:34,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:51:34,396 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:51:34,590 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:51:34,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:34,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1744451389, now seen corresponding path program 1 times [2025-01-10 00:51:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:34,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606602259] [2025-01-10 00:51:34,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:34,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:34,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:34,594 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:51:34,595 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:51:34,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:51:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:51:34,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:34,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:34,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:51:34,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:34,753 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:51:34,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:34,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:34,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606602259] [2025-01-10 00:51:34,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606602259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:34,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:34,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:34,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187855245] [2025-01-10 00:51:34,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:34,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:34,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:34,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:34,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:34,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:34,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:34,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:34,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:35,067 INFO L124 PetriNetUnfolderBase]: 1135/1978 cut-off events. [2025-01-10 00:51:35,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:35,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 1978 events. 1135/1978 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13631 event pairs, 1135 based on Foata normal form. 0/1838 useless extension candidates. Maximal degree in co-relation 3702. Up to 1694 conditions per place. [2025-01-10 00:51:35,082 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-01-10 00:51:35,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 134 flow [2025-01-10 00:51:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 00:51:35,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3493975903614458 [2025-01-10 00:51:35,083 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 104 flow. Second operand 3 states and 87 transitions. [2025-01-10 00:51:35,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 134 flow [2025-01-10 00:51:35,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:51:35,085 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2025-01-10 00:51:35,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:35,086 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -39 predicate places. [2025-01-10 00:51:35,086 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2025-01-10 00:51:35,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:35,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:35,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:35,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:51:35,287 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:51:35,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:35,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:35,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1783495869, now seen corresponding path program 1 times [2025-01-10 00:51:35,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:35,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438414995] [2025-01-10 00:51:35,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:35,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:35,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:35,290 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:51:35,291 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:51:35,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:51:35,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:51:35,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:35,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:35,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:51:35,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:35,401 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:51:35,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:35,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:35,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438414995] [2025-01-10 00:51:35,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438414995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:35,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:35,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:35,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049426324] [2025-01-10 00:51:35,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:35,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:35,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:35,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:35,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:35,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:35,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:51:35,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:35,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:35,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:35,686 INFO L124 PetriNetUnfolderBase]: 973/1735 cut-off events. [2025-01-10 00:51:35,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:35,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3232 conditions, 1735 events. 973/1735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11402 event pairs, 211 based on Foata normal form. 0/1646 useless extension candidates. Maximal degree in co-relation 3225. Up to 1171 conditions per place. [2025-01-10 00:51:35,696 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 33 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-01-10 00:51:35,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 179 flow [2025-01-10 00:51:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-01-10 00:51:35,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3654618473895582 [2025-01-10 00:51:35,698 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 91 transitions. [2025-01-10 00:51:35,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 179 flow [2025-01-10 00:51:35,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:51:35,699 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-01-10 00:51:35,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:35,700 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -38 predicate places. [2025-01-10 00:51:35,700 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-01-10 00:51:35,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:51:35,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:35,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:35,709 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:51:35,901 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:51:35,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:35,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:35,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1742735310, now seen corresponding path program 1 times [2025-01-10 00:51:35,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:35,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886304643] [2025-01-10 00:51:35,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:35,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:35,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:35,905 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:51:35,906 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:51:35,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:51:35,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:51:35,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:35,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:35,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:51:36,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:36,062 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:51:36,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:36,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886304643] [2025-01-10 00:51:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886304643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:51:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706923874] [2025-01-10 00:51:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:36,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:51:36,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:36,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:51:36,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:51:36,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:36,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:36,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:36,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:36,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:36,315 INFO L124 PetriNetUnfolderBase]: 898/1624 cut-off events. [2025-01-10 00:51:36,315 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-01-10 00:51:36,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1624 events. 898/1624 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10585 event pairs, 187 based on Foata normal form. 0/1607 useless extension candidates. Maximal degree in co-relation 3231. Up to 1059 conditions per place. [2025-01-10 00:51:36,324 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 32 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-01-10 00:51:36,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 182 flow [2025-01-10 00:51:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:51:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:51:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-01-10 00:51:36,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32228915662650603 [2025-01-10 00:51:36,325 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 107 transitions. [2025-01-10 00:51:36,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 182 flow [2025-01-10 00:51:36,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:51:36,327 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-01-10 00:51:36,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:36,328 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -38 predicate places. [2025-01-10 00:51:36,328 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-01-10 00:51:36,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:36,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:36,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:36,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 00:51:36,533 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:51:36,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:36,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1742735311, now seen corresponding path program 1 times [2025-01-10 00:51:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819335796] [2025-01-10 00:51:36,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:36,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:36,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:36,537 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:51:36,538 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:51:36,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:51:36,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:51:36,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:36,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:36,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:51:36,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:36,720 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:51:36,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:36,720 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:36,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819335796] [2025-01-10 00:51:36,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819335796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:36,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:36,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:51:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207705611] [2025-01-10 00:51:36,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:36,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:51:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:36,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:51:36,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:51:36,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2025-01-10 00:51:36,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:36,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:36,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2025-01-10 00:51:36,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:36,966 INFO L124 PetriNetUnfolderBase]: 823/1513 cut-off events. [2025-01-10 00:51:36,966 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-01-10 00:51:36,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 1513 events. 823/1513 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9832 event pairs, 163 based on Foata normal form. 36/1532 useless extension candidates. Maximal degree in co-relation 2973. Up to 948 conditions per place. [2025-01-10 00:51:36,974 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-01-10 00:51:36,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 176 flow [2025-01-10 00:51:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:51:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:51:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-01-10 00:51:36,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3192771084337349 [2025-01-10 00:51:36,976 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 106 transitions. [2025-01-10 00:51:36,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 176 flow [2025-01-10 00:51:36,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 171 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:51:36,978 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-01-10 00:51:36,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:36,979 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -39 predicate places. [2025-01-10 00:51:36,979 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-01-10 00:51:36,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:36,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:36,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:36,987 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:51:37,180 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:51:37,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:37,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1676247365, now seen corresponding path program 1 times [2025-01-10 00:51:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:37,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125451616] [2025-01-10 00:51:37,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:37,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:37,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:37,183 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:51:37,184 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:51:37,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:51:37,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:51:37,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:37,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:37,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:51:37,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:37,285 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:51:37,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:37,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125451616] [2025-01-10 00:51:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125451616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:37,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:37,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795876151] [2025-01-10 00:51:37,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:37,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:37,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:37,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:37,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:37,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 83 [2025-01-10 00:51:37,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:51:37,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:37,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 83 [2025-01-10 00:51:37,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:37,500 INFO L124 PetriNetUnfolderBase]: 823/1474 cut-off events. [2025-01-10 00:51:37,500 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-01-10 00:51:37,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2942 conditions, 1474 events. 823/1474 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9801 event pairs, 823 based on Foata normal form. 48/1478 useless extension candidates. Maximal degree in co-relation 2934. Up to 1238 conditions per place. [2025-01-10 00:51:37,505 INFO L140 encePairwiseOnDemand]: 81/83 looper letters, 19 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-01-10 00:51:37,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 125 flow [2025-01-10 00:51:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 00:51:37,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2931726907630522 [2025-01-10 00:51:37,507 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 73 transitions. [2025-01-10 00:51:37,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 125 flow [2025-01-10 00:51:37,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:51:37,508 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-01-10 00:51:37,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:37,509 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -40 predicate places. [2025-01-10 00:51:37,509 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-01-10 00:51:37,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:51:37,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:37,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:37,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:51:37,709 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:51:37,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:37,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:37,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1676248737, now seen corresponding path program 1 times [2025-01-10 00:51:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:37,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [153782954] [2025-01-10 00:51:37,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:37,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:37,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:37,713 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:51:37,715 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:51:37,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:51:37,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:51:37,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:37,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:37,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:51:37,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:37,830 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:51:37,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:37,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:37,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153782954] [2025-01-10 00:51:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153782954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:37,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:37,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:51:37,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822030200] [2025-01-10 00:51:37,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:37,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:51:37,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:37,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:51:37,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:51:37,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2025-01-10 00:51:37,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:37,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:37,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2025-01-10 00:51:37,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:38,256 INFO L124 PetriNetUnfolderBase]: 1678/2779 cut-off events. [2025-01-10 00:51:38,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:38,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5642 conditions, 2779 events. 1678/2779 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16910 event pairs, 186 based on Foata normal form. 100/2863 useless extension candidates. Maximal degree in co-relation 5634. Up to 1579 conditions per place. [2025-01-10 00:51:38,268 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 43 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2025-01-10 00:51:38,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 236 flow [2025-01-10 00:51:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:51:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:51:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-01-10 00:51:38,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32228915662650603 [2025-01-10 00:51:38,269 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 107 transitions. [2025-01-10 00:51:38,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 236 flow [2025-01-10 00:51:38,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:51:38,271 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2025-01-10 00:51:38,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:38,272 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -37 predicate places. [2025-01-10 00:51:38,272 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2025-01-10 00:51:38,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:38,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:38,273 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:51:38,279 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:51:38,477 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:51:38,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:38,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:38,477 INFO L85 PathProgramCache]: Analyzing trace with hash 217667325, now seen corresponding path program 1 times [2025-01-10 00:51:38,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:38,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340320097] [2025-01-10 00:51:38,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:38,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:38,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:38,480 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:51:38,482 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:51:38,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:51:38,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:51:38,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:38,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:38,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:51:38,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:38,596 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:51:38,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:38,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340320097] [2025-01-10 00:51:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340320097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:38,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:38,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:51:38,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475051578] [2025-01-10 00:51:38,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:38,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:51:38,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:38,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:51:38,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:51:38,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2025-01-10 00:51:38,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:51:38,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:38,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2025-01-10 00:51:38,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:38,899 INFO L124 PetriNetUnfolderBase]: 1036/1741 cut-off events. [2025-01-10 00:51:38,900 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2025-01-10 00:51:38,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4127 conditions, 1741 events. 1036/1741 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9283 event pairs, 98 based on Foata normal form. 82/1807 useless extension candidates. Maximal degree in co-relation 4116. Up to 697 conditions per place. [2025-01-10 00:51:38,905 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 54 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2025-01-10 00:51:38,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 338 flow [2025-01-10 00:51:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:51:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:51:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-10 00:51:38,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3253012048192771 [2025-01-10 00:51:38,906 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 135 transitions. [2025-01-10 00:51:38,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 338 flow [2025-01-10 00:51:38,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:51:38,907 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2025-01-10 00:51:38,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:38,908 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -33 predicate places. [2025-01-10 00:51:38,908 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2025-01-10 00:51:38,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:51:38,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:38,908 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:51:38,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:51:39,113 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:51:39,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:39,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash -136570391, now seen corresponding path program 1 times [2025-01-10 00:51:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428016679] [2025-01-10 00:51:39,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:39,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:39,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:39,116 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:51:39,117 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:51:39,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:51:39,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:51:39,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:39,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:39,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:51:39,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:39,260 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:51:39,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:39,260 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:39,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428016679] [2025-01-10 00:51:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428016679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:39,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:51:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652186606] [2025-01-10 00:51:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:39,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:51:39,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:39,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:51:39,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:51:39,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2025-01-10 00:51:39,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:51:39,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:39,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2025-01-10 00:51:39,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:39,562 INFO L124 PetriNetUnfolderBase]: 579/954 cut-off events. [2025-01-10 00:51:39,562 INFO L125 PetriNetUnfolderBase]: For 744/744 co-relation queries the response was YES. [2025-01-10 00:51:39,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2573 conditions, 954 events. 579/954 cut-off events. For 744/744 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4279 event pairs, 81 based on Foata normal form. 40/978 useless extension candidates. Maximal degree in co-relation 2560. Up to 308 conditions per place. [2025-01-10 00:51:39,566 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 47 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2025-01-10 00:51:39,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 343 flow [2025-01-10 00:51:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:51:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:51:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-10 00:51:39,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29116465863453816 [2025-01-10 00:51:39,568 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 145 transitions. [2025-01-10 00:51:39,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 343 flow [2025-01-10 00:51:39,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 318 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 00:51:39,573 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2025-01-10 00:51:39,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:39,574 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -30 predicate places. [2025-01-10 00:51:39,574 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2025-01-10 00:51:39,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:51:39,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:39,574 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:51:39,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 00:51:39,774 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:51:39,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:39,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1270740842, now seen corresponding path program 1 times [2025-01-10 00:51:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:39,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072172285] [2025-01-10 00:51:39,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:39,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:39,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:39,777 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:51:39,779 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:51:39,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:51:39,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:39,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:39,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:51:39,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:39,949 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:51:39,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:39,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072172285] [2025-01-10 00:51:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072172285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:51:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266132302] [2025-01-10 00:51:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:39,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:51:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:39,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:51:39,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:51:39,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 83 [2025-01-10 00:51:39,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:51:39,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:39,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 83 [2025-01-10 00:51:39,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:40,178 INFO L124 PetriNetUnfolderBase]: 698/1311 cut-off events. [2025-01-10 00:51:40,179 INFO L125 PetriNetUnfolderBase]: For 601/617 co-relation queries the response was YES. [2025-01-10 00:51:40,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3099 conditions, 1311 events. 698/1311 cut-off events. For 601/617 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7211 event pairs, 313 based on Foata normal form. 8/1277 useless extension candidates. Maximal degree in co-relation 3085. Up to 639 conditions per place. [2025-01-10 00:51:40,184 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 27 selfloop transitions, 2 changer transitions 17/63 dead transitions. [2025-01-10 00:51:40,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 317 flow [2025-01-10 00:51:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:51:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:51:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-01-10 00:51:40,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2751004016064257 [2025-01-10 00:51:40,185 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 6 states and 137 transitions. [2025-01-10 00:51:40,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 317 flow [2025-01-10 00:51:40,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 250 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-01-10 00:51:40,188 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 125 flow [2025-01-10 00:51:40,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, 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:51:40,189 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -29 predicate places. [2025-01-10 00:51:40,189 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 125 flow [2025-01-10 00:51:40,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:51:40,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:40,189 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:51:40,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 00:51:40,390 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:51:40,391 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:40,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash -708604722, now seen corresponding path program 2 times [2025-01-10 00:51:40,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:40,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633185887] [2025-01-10 00:51:40,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:51:40,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:40,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:40,395 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:51:40,396 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:51:40,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:51:40,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:40,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:51:40,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:40,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 00:51:40,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:40,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 00:51:40,937 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:51:40,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2025-01-10 00:51:41,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 00:51:41,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 00:51:41,307 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:51:41,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:41,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:41,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633185887] [2025-01-10 00:51:41,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633185887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:41,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:41,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:51:41,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399618784] [2025-01-10 00:51:41,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:41,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:51:41,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:41,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:51:41,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:51:41,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2025-01-10 00:51:41,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 125 flow. Second operand has 12 states, 12 states have (on average 15.75) internal successors, (189), 12 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:51:41,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:41,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2025-01-10 00:51:41,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:42,045 INFO L124 PetriNetUnfolderBase]: 602/1036 cut-off events. [2025-01-10 00:51:42,046 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-01-10 00:51:42,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2305 conditions, 1036 events. 602/1036 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4503 event pairs, 176 based on Foata normal form. 8/1034 useless extension candidates. Maximal degree in co-relation 2292. Up to 535 conditions per place. [2025-01-10 00:51:42,054 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 38 selfloop transitions, 7 changer transitions 33/88 dead transitions. [2025-01-10 00:51:42,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 414 flow [2025-01-10 00:51:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:51:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:51:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2025-01-10 00:51:42,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26639892904953144 [2025-01-10 00:51:42,058 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 125 flow. Second operand 9 states and 199 transitions. [2025-01-10 00:51:42,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 414 flow [2025-01-10 00:51:42,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 396 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:51:42,060 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 157 flow [2025-01-10 00:51:42,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=157, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-01-10 00:51:42,060 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -23 predicate places. [2025-01-10 00:51:42,060 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 157 flow [2025-01-10 00:51:42,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.75) internal successors, (189), 12 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:51:42,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:42,060 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:51:42,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 00:51:42,263 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:51:42,264 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:42,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1881681110, now seen corresponding path program 3 times [2025-01-10 00:51:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:42,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549319912] [2025-01-10 00:51:42,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:51:42,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:42,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:42,267 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:42,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 00:51:42,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:51:42,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:42,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:51:42,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:42,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 00:51:42,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:42,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 00:51:42,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 00:51:42,783 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:51:42,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:42,784 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:42,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549319912] [2025-01-10 00:51:42,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549319912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:42,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:42,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:51:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219288110] [2025-01-10 00:51:42,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:42,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:51:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:42,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:51:42,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:51:42,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2025-01-10 00:51:42,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 157 flow. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:51:42,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:42,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2025-01-10 00:51:42,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:43,391 INFO L124 PetriNetUnfolderBase]: 880/1528 cut-off events. [2025-01-10 00:51:43,392 INFO L125 PetriNetUnfolderBase]: For 414/417 co-relation queries the response was YES. [2025-01-10 00:51:43,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3588 conditions, 1528 events. 880/1528 cut-off events. For 414/417 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7522 event pairs, 154 based on Foata normal form. 9/1527 useless extension candidates. Maximal degree in co-relation 3572. Up to 571 conditions per place. [2025-01-10 00:51:43,397 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 48 selfloop transitions, 16 changer transitions 43/117 dead transitions. [2025-01-10 00:51:43,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 595 flow [2025-01-10 00:51:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:51:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:51:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2025-01-10 00:51:43,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27163198247535597 [2025-01-10 00:51:43,399 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 157 flow. Second operand 11 states and 248 transitions. [2025-01-10 00:51:43,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 595 flow [2025-01-10 00:51:43,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 559 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-01-10 00:51:43,401 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 241 flow [2025-01-10 00:51:43,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=241, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2025-01-10 00:51:43,405 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -16 predicate places. [2025-01-10 00:51:43,405 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 241 flow [2025-01-10 00:51:43,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:51:43,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:43,405 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:51:43,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 00:51:43,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:43,606 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2025-01-10 00:51:43,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:43,606 INFO L85 PathProgramCache]: Analyzing trace with hash -722335802, now seen corresponding path program 4 times [2025-01-10 00:51:43,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:43,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656106457] [2025-01-10 00:51:43,607 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:51:43,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:43,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:43,609 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:43,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 00:51:43,685 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-01-10 00:51:43,746 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:43,746 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:51:43,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:51:43,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:51:43,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:51:43,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:51:43,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:43,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:51:43,845 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:51:43,845 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:51:43,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (78 of 79 remaining) [2025-01-10 00:51:43,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 79 remaining) [2025-01-10 00:51:43,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 79 remaining) [2025-01-10 00:51:43,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 79 remaining) [2025-01-10 00:51:43,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (37 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 79 remaining) [2025-01-10 00:51:43,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 79 remaining) [2025-01-10 00:51:43,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 79 remaining) [2025-01-10 00:51:43,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 79 remaining) [2025-01-10 00:51:43,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 00:51:44,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:44,054 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:44,127 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:51:44,128 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:51:44,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:51:44 BasicIcfg [2025-01-10 00:51:44,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:51:44,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:51:44,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:51:44,132 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:51:44,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:32" (3/4) ... [2025-01-10 00:51:44,134 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:51:44,135 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:51:44,135 INFO L158 Benchmark]: Toolchain (without parser) took 13384.60ms. Allocated memory was 83.9MB in the beginning and 763.4MB in the end (delta: 679.5MB). Free memory was 57.4MB in the beginning and 436.8MB in the end (delta: -379.3MB). Peak memory consumption was 300.8MB. Max. memory is 16.1GB. [2025-01-10 00:51:44,135 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:44,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.10ms. Allocated memory is still 83.9MB. Free memory was 57.3MB in the beginning and 53.3MB in the end (delta: 4.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-01-10 00:51:44,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.73ms. Allocated memory is still 83.9MB. Free memory was 53.3MB in the beginning and 51.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:44,136 INFO L158 Benchmark]: Boogie Preprocessor took 43.24ms. Allocated memory is still 83.9MB. Free memory was 51.1MB in the beginning and 47.3MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:51:44,136 INFO L158 Benchmark]: RCFGBuilder took 1041.44ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 39.5MB in the end (delta: 7.9MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-01-10 00:51:44,136 INFO L158 Benchmark]: TraceAbstraction took 11825.12ms. Allocated memory was 100.7MB in the beginning and 763.4MB in the end (delta: 662.7MB). Free memory was 38.6MB in the beginning and 436.9MB in the end (delta: -398.3MB). Peak memory consumption was 265.7MB. Max. memory is 16.1GB. [2025-01-10 00:51:44,136 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 763.4MB. Free memory was 436.9MB in the beginning and 436.8MB in the end (delta: 84.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:44,137 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.24ms. Allocated memory is still 83.9MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.10ms. Allocated memory is still 83.9MB. Free memory was 57.3MB in the beginning and 53.3MB in the end (delta: 4.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.73ms. Allocated memory is still 83.9MB. Free memory was 53.3MB in the beginning and 51.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.24ms. Allocated memory is still 83.9MB. Free memory was 51.1MB in the beginning and 47.3MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1041.44ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 39.5MB in the end (delta: 7.9MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11825.12ms. Allocated memory was 100.7MB in the beginning and 763.4MB in the end (delta: 662.7MB). Free memory was 38.6MB in the beginning and 436.9MB in the end (delta: -398.3MB). Peak memory consumption was 265.7MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 763.4MB. Free memory was 436.9MB in the beginning and 436.8MB in the end (delta: 84.8kB). 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; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-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] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-2, t2270=-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] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-2, t2270=-1, t2271=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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$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] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$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] [L759] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$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] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] 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) [L768] EXPR 1 \read(x) [L768] 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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$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] [L827] 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) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] 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) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$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] [L789] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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] [L856] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269=-2, t2270=-1, t2271=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] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269=-2, t2270=-1, t2271=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] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269=-2, t2270=-1, t2271=0, weak$$choice0=0, weak$$choice1=1, 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] [L871] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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] [L18] 0 __assert_fail ("0", "safe020_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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 79 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: 11.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 452 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1729 IncrementalHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 9 mSDtfsCounter, 1729 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=12, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 1692 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1627 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:51:44,154 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