./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:24:12,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:24:12,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:24:12,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:24:12,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:24:12,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:24:12,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:24:12,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:24:12,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:24:12,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:24:12,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:24:12,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:24:12,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:24:12,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:24:12,245 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:24:12,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:24:12,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:24:12,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:24:12,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:24:12,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:24:12,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:24:12,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:24:12,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:24:12,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:24:12,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:24:12,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:24:12,247 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2025-02-08 08:24:12,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:24:12,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:24:12,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:24:12,440 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:24:12,440 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:24:12,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2025-02-08 08:24:13,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4937067a4/936ad560670c403d97d6ff50f1f9bd13/FLAG78a1c34bc [2025-02-08 08:24:14,116 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:24:14,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2025-02-08 08:24:14,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4937067a4/936ad560670c403d97d6ff50f1f9bd13/FLAG78a1c34bc [2025-02-08 08:24:14,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4937067a4/936ad560670c403d97d6ff50f1f9bd13 [2025-02-08 08:24:14,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:24:14,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:24:14,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:24:14,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:24:14,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:24:14,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af11a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14, skipping insertion in model container [2025-02-08 08:24:14,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:24:14,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:24:14,468 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:24:14,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:24:14,572 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:24:14,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14 WrapperNode [2025-02-08 08:24:14,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:24:14,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:24:14,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:24:14,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:24:14,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,601 INFO L138 Inliner]: procedures = 175, calls = 60, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2025-02-08 08:24:14,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:24:14,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:24:14,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:24:14,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:24:14,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,629 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2025-02-08 08:24:14,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:24:14,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:24:14,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:24:14,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:24:14,653 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (1/1) ... [2025-02-08 08:24:14,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:24:14,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:14,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:24:14,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:24:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:24:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:24:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:24:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:24:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:24:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:24:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:24:14,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:24:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:24:14,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:24:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:24:14,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:24:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:24:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:24:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:24:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:24:14,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:24:14,701 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:24:14,809 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:24:14,810 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:24:15,286 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:24:15,287 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:24:15,607 WARN L170 LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 08:24:15,721 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:24:15,722 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:24:15,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:24:15 BoogieIcfgContainer [2025-02-08 08:24:15,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:24:15,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:24:15,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:24:15,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:24:15,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:24:14" (1/3) ... [2025-02-08 08:24:15,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aca7820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:24:15, skipping insertion in model container [2025-02-08 08:24:15,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:14" (2/3) ... [2025-02-08 08:24:15,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aca7820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:24:15, skipping insertion in model container [2025-02-08 08:24:15,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:24:15" (3/3) ... [2025-02-08 08:24:15,729 INFO L128 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2025-02-08 08:24:15,740 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:24:15,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe012_power.opt.i that has 4 procedures, 73 locations, 1 initial locations, 0 loop locations, and 33 error locations. [2025-02-08 08:24:15,742 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:24:15,915 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:24:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 101 transitions, 214 flow [2025-02-08 08:24:15,974 INFO L124 PetriNetUnfolderBase]: 29/98 cut-off events. [2025-02-08 08:24:15,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:24:15,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 29/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 329 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2025-02-08 08:24:15,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 101 transitions, 214 flow [2025-02-08 08:24:15,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 98 transitions, 205 flow [2025-02-08 08:24:15,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:24:15,995 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;@7551389a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:24:15,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-08 08:24:15,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:24:15,999 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-08 08:24:15,999 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:24:15,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:16,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:16,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1317626872, now seen corresponding path program 1 times [2025-02-08 08:24:16,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:16,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830522390] [2025-02-08 08:24:16,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:16,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:24:16,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:24:16,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:16,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:16,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830522390] [2025-02-08 08:24:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830522390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:16,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:16,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:24:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999924219] [2025-02-08 08:24:16,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:16,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:16,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:16,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:16,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:16,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:16,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:16,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:16,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:22,550 INFO L124 PetriNetUnfolderBase]: 49851/70729 cut-off events. [2025-02-08 08:24:22,551 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-02-08 08:24:22,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139284 conditions, 70729 events. 49851/70729 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 3033. Compared 514477 event pairs, 17323 based on Foata normal form. 2304/46868 useless extension candidates. Maximal degree in co-relation 139273. Up to 35793 conditions per place. [2025-02-08 08:24:22,991 INFO L140 encePairwiseOnDemand]: 54/101 looper letters, 86 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-02-08 08:24:22,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 382 flow [2025-02-08 08:24:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2025-02-08 08:24:23,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66996699669967 [2025-02-08 08:24:23,005 INFO L175 Difference]: Start difference. First operand has 79 places, 98 transitions, 205 flow. Second operand 3 states and 203 transitions. [2025-02-08 08:24:23,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 382 flow [2025-02-08 08:24:23,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 378 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:24:23,013 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 140 flow [2025-02-08 08:24:23,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-02-08 08:24:23,020 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2025-02-08 08:24:23,020 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 140 flow [2025-02-08 08:24:23,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:23,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:23,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:23,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:24:23,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2102946963, now seen corresponding path program 1 times [2025-02-08 08:24:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:23,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536287149] [2025-02-08 08:24:23,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:23,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:23,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:24:23,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:24:23,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:23,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:23,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:23,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536287149] [2025-02-08 08:24:23,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536287149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:23,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:23,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:24:23,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560814513] [2025-02-08 08:24:23,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:23,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:23,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:23,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:23,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:23,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:23,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:23,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:25,822 INFO L124 PetriNetUnfolderBase]: 25615/38045 cut-off events. [2025-02-08 08:24:25,823 INFO L125 PetriNetUnfolderBase]: For 4446/4446 co-relation queries the response was YES. [2025-02-08 08:24:25,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77685 conditions, 38045 events. 25615/38045 cut-off events. For 4446/4446 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 266952 event pairs, 24103 based on Foata normal form. 0/29230 useless extension candidates. Maximal degree in co-relation 77673. Up to 35300 conditions per place. [2025-02-08 08:24:26,003 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-08 08:24:26,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 212 flow [2025-02-08 08:24:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-08 08:24:26,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2607260726072607 [2025-02-08 08:24:26,005 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 140 flow. Second operand 3 states and 79 transitions. [2025-02-08 08:24:26,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 212 flow [2025-02-08 08:24:26,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:24:26,009 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 122 flow [2025-02-08 08:24:26,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-02-08 08:24:26,010 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2025-02-08 08:24:26,010 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 122 flow [2025-02-08 08:24:26,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:26,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:26,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:26,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:24:26,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2102946964, now seen corresponding path program 1 times [2025-02-08 08:24:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412868633] [2025-02-08 08:24:26,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:26,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:24:26,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:24:26,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:26,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:26,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:26,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412868633] [2025-02-08 08:24:26,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412868633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:26,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:26,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:24:26,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199267038] [2025-02-08 08:24:26,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:26,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:26,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:26,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:26,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:26,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:26,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:26,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:26,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:26,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:27,545 INFO L124 PetriNetUnfolderBase]: 10571/16041 cut-off events. [2025-02-08 08:24:27,545 INFO L125 PetriNetUnfolderBase]: For 863/863 co-relation queries the response was YES. [2025-02-08 08:24:27,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32561 conditions, 16041 events. 10571/16041 cut-off events. For 863/863 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 102189 event pairs, 9707 based on Foata normal form. 430/14930 useless extension candidates. Maximal degree in co-relation 32553. Up to 14688 conditions per place. [2025-02-08 08:24:27,615 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-02-08 08:24:27,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 180 flow [2025-02-08 08:24:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-08 08:24:27,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2376237623762376 [2025-02-08 08:24:27,618 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 122 flow. Second operand 3 states and 72 transitions. [2025-02-08 08:24:27,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 180 flow [2025-02-08 08:24:27,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:24:27,620 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 107 flow [2025-02-08 08:24:27,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2025-02-08 08:24:27,623 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2025-02-08 08:24:27,623 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 107 flow [2025-02-08 08:24:27,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:27,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:27,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:27,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:24:27,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:27,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1898290274, now seen corresponding path program 1 times [2025-02-08 08:24:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:27,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886142231] [2025-02-08 08:24:27,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:27,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:27,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:24:27,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:24:27,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:27,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:27,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:27,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886142231] [2025-02-08 08:24:27,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886142231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:27,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:27,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:24:27,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615475607] [2025-02-08 08:24:27,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:27,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:27,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:27,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:27,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:27,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:27,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:27,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:27,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:27,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:28,774 INFO L124 PetriNetUnfolderBase]: 9337/13199 cut-off events. [2025-02-08 08:24:28,774 INFO L125 PetriNetUnfolderBase]: For 656/656 co-relation queries the response was YES. [2025-02-08 08:24:28,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27706 conditions, 13199 events. 9337/13199 cut-off events. For 656/656 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 73877 event pairs, 1115 based on Foata normal form. 0/11946 useless extension candidates. Maximal degree in co-relation 27697. Up to 12003 conditions per place. [2025-02-08 08:24:28,828 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 47 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-02-08 08:24:28,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 251 flow [2025-02-08 08:24:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-08 08:24:28,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2025-02-08 08:24:28,830 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 107 flow. Second operand 3 states and 84 transitions. [2025-02-08 08:24:28,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 251 flow [2025-02-08 08:24:28,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:24:28,832 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 128 flow [2025-02-08 08:24:28,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-02-08 08:24:28,833 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2025-02-08 08:24:28,834 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 128 flow [2025-02-08 08:24:28,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:28,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:28,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:28,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:24:28,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:28,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash -863615392, now seen corresponding path program 1 times [2025-02-08 08:24:28,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:28,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293585746] [2025-02-08 08:24:28,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:28,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:28,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:24:28,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:24:28,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:28,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:29,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293585746] [2025-02-08 08:24:29,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293585746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:29,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:24:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420547954] [2025-02-08 08:24:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:29,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:24:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:29,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:24:29,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:24:29,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:29,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:29,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:29,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:29,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:30,340 INFO L124 PetriNetUnfolderBase]: 8607/12169 cut-off events. [2025-02-08 08:24:30,340 INFO L125 PetriNetUnfolderBase]: For 1506/1506 co-relation queries the response was YES. [2025-02-08 08:24:30,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27862 conditions, 12169 events. 8607/12169 cut-off events. For 1506/1506 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 67340 event pairs, 875 based on Foata normal form. 0/11516 useless extension candidates. Maximal degree in co-relation 27851. Up to 10972 conditions per place. [2025-02-08 08:24:30,397 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 46 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-02-08 08:24:30,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 266 flow [2025-02-08 08:24:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:24:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:24:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-08 08:24:30,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22772277227722773 [2025-02-08 08:24:30,398 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 128 flow. Second operand 4 states and 92 transitions. [2025-02-08 08:24:30,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 266 flow [2025-02-08 08:24:30,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:24:30,401 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 124 flow [2025-02-08 08:24:30,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-02-08 08:24:30,402 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2025-02-08 08:24:30,402 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 124 flow [2025-02-08 08:24:30,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:30,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:30,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:30,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:24:30,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:30,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash -863615393, now seen corresponding path program 1 times [2025-02-08 08:24:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:30,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005766247] [2025-02-08 08:24:30,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:30,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:24:30,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:24:30,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:30,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:30,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005766247] [2025-02-08 08:24:30,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005766247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:30,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:30,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:24:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974473263] [2025-02-08 08:24:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:30,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:24:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:30,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:24:30,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:24:30,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:30,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:30,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:30,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:30,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:31,833 INFO L124 PetriNetUnfolderBase]: 7877/11139 cut-off events. [2025-02-08 08:24:31,833 INFO L125 PetriNetUnfolderBase]: For 1476/1476 co-relation queries the response was YES. [2025-02-08 08:24:31,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25472 conditions, 11139 events. 7877/11139 cut-off events. For 1476/1476 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 60955 event pairs, 635 based on Foata normal form. 300/10786 useless extension candidates. Maximal degree in co-relation 25461. Up to 9942 conditions per place. [2025-02-08 08:24:31,883 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 45 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-02-08 08:24:31,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 260 flow [2025-02-08 08:24:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:24:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:24:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-08 08:24:31,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22524752475247525 [2025-02-08 08:24:31,885 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 124 flow. Second operand 4 states and 91 transitions. [2025-02-08 08:24:31,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 260 flow [2025-02-08 08:24:31,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 247 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:24:31,887 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 119 flow [2025-02-08 08:24:31,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-02-08 08:24:31,888 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2025-02-08 08:24:31,888 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 119 flow [2025-02-08 08:24:31,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:31,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:31,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:31,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:24:31,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:31,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash 254105307, now seen corresponding path program 1 times [2025-02-08 08:24:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:31,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817373326] [2025-02-08 08:24:31,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:31,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:24:31,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:24:31,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:31,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:31,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:31,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817373326] [2025-02-08 08:24:31,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817373326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:31,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:31,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:24:31,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916986409] [2025-02-08 08:24:31,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:31,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:31,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:31,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:31,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-08 08:24:31,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:31,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:31,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-08 08:24:31,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:32,656 INFO L124 PetriNetUnfolderBase]: 7877/12003 cut-off events. [2025-02-08 08:24:32,656 INFO L125 PetriNetUnfolderBase]: For 1287/1287 co-relation queries the response was YES. [2025-02-08 08:24:32,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26335 conditions, 12003 events. 7877/12003 cut-off events. For 1287/1287 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 73498 event pairs, 7229 based on Foata normal form. 336/11686 useless extension candidates. Maximal degree in co-relation 26325. Up to 10986 conditions per place. [2025-02-08 08:24:32,699 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 31 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-02-08 08:24:32,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 183 flow [2025-02-08 08:24:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-08 08:24:32,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19801980198019803 [2025-02-08 08:24:32,700 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 119 flow. Second operand 3 states and 60 transitions. [2025-02-08 08:24:32,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 183 flow [2025-02-08 08:24:32,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:24:32,702 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 110 flow [2025-02-08 08:24:32,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=110, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-08 08:24:32,702 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2025-02-08 08:24:32,702 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 110 flow [2025-02-08 08:24:32,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:32,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:32,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:32,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:24:32,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:32,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash 254104301, now seen corresponding path program 1 times [2025-02-08 08:24:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:32,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696674184] [2025-02-08 08:24:32,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:32,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:24:32,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:24:32,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:32,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696674184] [2025-02-08 08:24:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696674184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:32,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:32,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:24:32,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91399332] [2025-02-08 08:24:32,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:32,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:24:32,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:32,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:24:32,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:24:32,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-08 08:24:32,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:32,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:32,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-08 08:24:32,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:34,012 INFO L124 PetriNetUnfolderBase]: 9655/14112 cut-off events. [2025-02-08 08:24:34,012 INFO L125 PetriNetUnfolderBase]: For 824/824 co-relation queries the response was YES. [2025-02-08 08:24:34,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31846 conditions, 14112 events. 9655/14112 cut-off events. For 824/824 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 84925 event pairs, 1082 based on Foata normal form. 0/13014 useless extension candidates. Maximal degree in co-relation 31836. Up to 8343 conditions per place. [2025-02-08 08:24:34,086 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 52 selfloop transitions, 2 changer transitions 90/149 dead transitions. [2025-02-08 08:24:34,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 149 transitions, 756 flow [2025-02-08 08:24:34,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:24:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:24:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2025-02-08 08:24:34,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26113861386138615 [2025-02-08 08:24:34,088 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 110 flow. Second operand 8 states and 211 transitions. [2025-02-08 08:24:34,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 149 transitions, 756 flow [2025-02-08 08:24:34,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 149 transitions, 755 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:24:34,090 INFO L231 Difference]: Finished difference. Result has 60 places, 37 transitions, 123 flow [2025-02-08 08:24:34,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=8, PETRI_FLOW=123, PETRI_PLACES=60, PETRI_TRANSITIONS=37} [2025-02-08 08:24:34,090 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2025-02-08 08:24:34,090 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 37 transitions, 123 flow [2025-02-08 08:24:34,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:34,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:34,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:34,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:24:34,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:34,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:34,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2013301696, now seen corresponding path program 1 times [2025-02-08 08:24:34,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:34,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806063403] [2025-02-08 08:24:34,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:34,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:24:34,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:24:34,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:34,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:34,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:34,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806063403] [2025-02-08 08:24:34,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806063403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:34,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:34,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:24:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146815500] [2025-02-08 08:24:34,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:34,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:24:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:34,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:24:34,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:24:34,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-08 08:24:34,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 37 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:34,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:34,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-08 08:24:34,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:35,287 INFO L124 PetriNetUnfolderBase]: 9323/13657 cut-off events. [2025-02-08 08:24:35,288 INFO L125 PetriNetUnfolderBase]: For 2268/2268 co-relation queries the response was YES. [2025-02-08 08:24:35,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32005 conditions, 13657 events. 9323/13657 cut-off events. For 2268/2268 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 78195 event pairs, 1485 based on Foata normal form. 280/13452 useless extension candidates. Maximal degree in co-relation 31989. Up to 5361 conditions per place. [2025-02-08 08:24:35,333 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 50 selfloop transitions, 3 changer transitions 67/125 dead transitions. [2025-02-08 08:24:35,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 125 transitions, 606 flow [2025-02-08 08:24:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:24:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:24:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-02-08 08:24:35,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23638613861386137 [2025-02-08 08:24:35,335 INFO L175 Difference]: Start difference. First operand has 60 places, 37 transitions, 123 flow. Second operand 8 states and 191 transitions. [2025-02-08 08:24:35,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 125 transitions, 606 flow [2025-02-08 08:24:35,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 125 transitions, 584 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 08:24:35,389 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 133 flow [2025-02-08 08:24:35,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2025-02-08 08:24:35,390 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -18 predicate places. [2025-02-08 08:24:35,390 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 133 flow [2025-02-08 08:24:35,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:35,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:35,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:35,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:24:35,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:35,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash 20929933, now seen corresponding path program 1 times [2025-02-08 08:24:35,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:35,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110619290] [2025-02-08 08:24:35,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:35,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:35,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:24:35,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:24:35,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:35,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:35,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110619290] [2025-02-08 08:24:35,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110619290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:35,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:24:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240054420] [2025-02-08 08:24:35,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:35,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:24:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:35,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:24:35,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:24:35,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-08 08:24:35,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 133 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:35,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:35,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-08 08:24:35,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:36,521 INFO L124 PetriNetUnfolderBase]: 4790/7284 cut-off events. [2025-02-08 08:24:36,522 INFO L125 PetriNetUnfolderBase]: For 2486/2486 co-relation queries the response was YES. [2025-02-08 08:24:36,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17058 conditions, 7284 events. 4790/7284 cut-off events. For 2486/2486 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 39722 event pairs, 2610 based on Foata normal form. 135/7358 useless extension candidates. Maximal degree in co-relation 17040. Up to 5007 conditions per place. [2025-02-08 08:24:36,559 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 60 selfloop transitions, 7 changer transitions 59/131 dead transitions. [2025-02-08 08:24:36,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 131 transitions, 621 flow [2025-02-08 08:24:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:24:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:24:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2025-02-08 08:24:36,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20522052205220523 [2025-02-08 08:24:36,564 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 133 flow. Second operand 11 states and 228 transitions. [2025-02-08 08:24:36,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 131 transitions, 621 flow [2025-02-08 08:24:36,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 131 transitions, 571 flow, removed 16 selfloop flow, removed 8 redundant places. [2025-02-08 08:24:36,602 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 173 flow [2025-02-08 08:24:36,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=173, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2025-02-08 08:24:36,602 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -12 predicate places. [2025-02-08 08:24:36,602 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 173 flow [2025-02-08 08:24:36,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:36,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:36,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:36,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:24:36,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:36,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 72178663, now seen corresponding path program 1 times [2025-02-08 08:24:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710389342] [2025-02-08 08:24:36,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:36,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:24:36,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:24:36,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:36,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:36,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:36,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710389342] [2025-02-08 08:24:36,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710389342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:36,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:36,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:24:36,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150333773] [2025-02-08 08:24:36,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:36,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:36,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:36,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:36,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:36,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:36,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 41 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:36,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:36,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:36,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:37,105 INFO L124 PetriNetUnfolderBase]: 3962/6087 cut-off events. [2025-02-08 08:24:37,106 INFO L125 PetriNetUnfolderBase]: For 6124/6124 co-relation queries the response was YES. [2025-02-08 08:24:37,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16858 conditions, 6087 events. 3962/6087 cut-off events. For 6124/6124 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 32623 event pairs, 3223 based on Foata normal form. 0/6028 useless extension candidates. Maximal degree in co-relation 16838. Up to 5387 conditions per place. [2025-02-08 08:24:37,143 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 44 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2025-02-08 08:24:37,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 342 flow [2025-02-08 08:24:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-02-08 08:24:37,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26732673267326734 [2025-02-08 08:24:37,145 INFO L175 Difference]: Start difference. First operand has 67 places, 41 transitions, 173 flow. Second operand 3 states and 81 transitions. [2025-02-08 08:24:37,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 342 flow [2025-02-08 08:24:37,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 59 transitions, 323 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 08:24:37,162 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 226 flow [2025-02-08 08:24:37,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-02-08 08:24:37,164 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2025-02-08 08:24:37,164 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 226 flow [2025-02-08 08:24:37,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:37,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:37,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:37,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:24:37,164 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:37,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash -239088442, now seen corresponding path program 1 times [2025-02-08 08:24:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:37,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485112840] [2025-02-08 08:24:37,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:37,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:37,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:24:37,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:24:37,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:37,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:37,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:37,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485112840] [2025-02-08 08:24:37,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485112840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:37,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:37,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:24:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746325319] [2025-02-08 08:24:37,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:37,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:37,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:37,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:37,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:37,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:37,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:37,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:37,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:37,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:37,643 INFO L124 PetriNetUnfolderBase]: 3941/6066 cut-off events. [2025-02-08 08:24:37,644 INFO L125 PetriNetUnfolderBase]: For 7393/7393 co-relation queries the response was YES. [2025-02-08 08:24:37,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16973 conditions, 6066 events. 3941/6066 cut-off events. For 7393/7393 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 32339 event pairs, 3468 based on Foata normal form. 0/6028 useless extension candidates. Maximal degree in co-relation 16957. Up to 5742 conditions per place. [2025-02-08 08:24:37,677 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 38 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2025-02-08 08:24:37,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 44 transitions, 287 flow [2025-02-08 08:24:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-02-08 08:24:37,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20132013201320131 [2025-02-08 08:24:37,679 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 226 flow. Second operand 3 states and 61 transitions. [2025-02-08 08:24:37,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 44 transitions, 287 flow [2025-02-08 08:24:37,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 44 transitions, 270 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-08 08:24:37,683 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 194 flow [2025-02-08 08:24:37,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2025-02-08 08:24:37,686 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2025-02-08 08:24:37,686 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 194 flow [2025-02-08 08:24:37,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:37,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:37,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:37,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:24:37,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:37,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2130924746, now seen corresponding path program 1 times [2025-02-08 08:24:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:37,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528096997] [2025-02-08 08:24:37,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:37,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:37,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:24:37,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:24:37,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:37,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528096997] [2025-02-08 08:24:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528096997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:37,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:37,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:24:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376725885] [2025-02-08 08:24:37,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:37,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:37,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:37,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:37,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:37,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:37,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:37,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:37,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:37,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:38,139 INFO L124 PetriNetUnfolderBase]: 3920/6045 cut-off events. [2025-02-08 08:24:38,139 INFO L125 PetriNetUnfolderBase]: For 6860/6860 co-relation queries the response was YES. [2025-02-08 08:24:38,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16631 conditions, 6045 events. 3920/6045 cut-off events. For 6860/6860 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 32306 event pairs, 3468 based on Foata normal form. 0/6028 useless extension candidates. Maximal degree in co-relation 16614. Up to 5721 conditions per place. [2025-02-08 08:24:38,172 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 36 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2025-02-08 08:24:38,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 42 transitions, 254 flow [2025-02-08 08:24:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-08 08:24:38,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19801980198019803 [2025-02-08 08:24:38,173 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 194 flow. Second operand 3 states and 60 transitions. [2025-02-08 08:24:38,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 42 transitions, 254 flow [2025-02-08 08:24:38,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 42 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:24:38,179 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 181 flow [2025-02-08 08:24:38,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2025-02-08 08:24:38,180 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2025-02-08 08:24:38,180 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 181 flow [2025-02-08 08:24:38,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:38,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:38,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:38,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:24:38,181 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:38,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:38,181 INFO L85 PathProgramCache]: Analyzing trace with hash -924495811, now seen corresponding path program 1 times [2025-02-08 08:24:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:38,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110973470] [2025-02-08 08:24:38,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:38,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:38,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:24:38,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:24:38,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:38,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:38,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110973470] [2025-02-08 08:24:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110973470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:24:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082012963] [2025-02-08 08:24:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:38,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:24:38,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:38,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:24:38,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:24:38,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:38,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:38,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:38,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:38,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:38,723 INFO L124 PetriNetUnfolderBase]: 3475/5466 cut-off events. [2025-02-08 08:24:38,724 INFO L125 PetriNetUnfolderBase]: For 4515/4515 co-relation queries the response was YES. [2025-02-08 08:24:38,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14592 conditions, 5466 events. 3475/5466 cut-off events. For 4515/4515 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 30455 event pairs, 393 based on Foata normal form. 256/5706 useless extension candidates. Maximal degree in co-relation 14574. Up to 3067 conditions per place. [2025-02-08 08:24:38,747 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 67 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2025-02-08 08:24:38,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 483 flow [2025-02-08 08:24:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:24:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:24:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-02-08 08:24:38,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25742574257425743 [2025-02-08 08:24:38,748 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 181 flow. Second operand 4 states and 104 transitions. [2025-02-08 08:24:38,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 483 flow [2025-02-08 08:24:38,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 482 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:24:38,752 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 208 flow [2025-02-08 08:24:38,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2025-02-08 08:24:38,752 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2025-02-08 08:24:38,753 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 208 flow [2025-02-08 08:24:38,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:38,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:38,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:38,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:24:38,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:38,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:38,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2137547014, now seen corresponding path program 1 times [2025-02-08 08:24:38,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:38,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278493535] [2025-02-08 08:24:38,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:38,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:38,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:24:38,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:24:38,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:38,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:38,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:38,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278493535] [2025-02-08 08:24:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278493535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:38,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:24:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250658327] [2025-02-08 08:24:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:38,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:24:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:38,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:24:38,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:24:38,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:38,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:38,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:38,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:38,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:39,376 INFO L124 PetriNetUnfolderBase]: 4084/6437 cut-off events. [2025-02-08 08:24:39,376 INFO L125 PetriNetUnfolderBase]: For 6587/6587 co-relation queries the response was YES. [2025-02-08 08:24:39,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19039 conditions, 6437 events. 4084/6437 cut-off events. For 6587/6587 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 36576 event pairs, 3314 based on Foata normal form. 0/6436 useless extension candidates. Maximal degree in co-relation 19018. Up to 3764 conditions per place. [2025-02-08 08:24:39,404 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 66 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2025-02-08 08:24:39,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 492 flow [2025-02-08 08:24:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:24:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:24:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-02-08 08:24:39,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25742574257425743 [2025-02-08 08:24:39,408 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 208 flow. Second operand 4 states and 104 transitions. [2025-02-08 08:24:39,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 492 flow [2025-02-08 08:24:39,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 471 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 08:24:39,413 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 208 flow [2025-02-08 08:24:39,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-02-08 08:24:39,413 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -14 predicate places. [2025-02-08 08:24:39,414 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 208 flow [2025-02-08 08:24:39,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:39,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:39,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:39,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:24:39,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:39,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1368174462, now seen corresponding path program 1 times [2025-02-08 08:24:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:39,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546425967] [2025-02-08 08:24:39,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:39,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:24:39,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:24:39,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:39,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:39,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:39,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546425967] [2025-02-08 08:24:39,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546425967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:39,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:39,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:24:39,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233397840] [2025-02-08 08:24:39,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:39,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:24:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:39,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:24:39,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:24:39,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:39,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:39,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:39,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:39,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:39,886 INFO L124 PetriNetUnfolderBase]: 2942/4759 cut-off events. [2025-02-08 08:24:39,886 INFO L125 PetriNetUnfolderBase]: For 4543/4543 co-relation queries the response was YES. [2025-02-08 08:24:39,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13229 conditions, 4759 events. 2942/4759 cut-off events. For 4543/4543 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 26307 event pairs, 278 based on Foata normal form. 264/5022 useless extension candidates. Maximal degree in co-relation 13208. Up to 1945 conditions per place. [2025-02-08 08:24:39,902 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 73 selfloop transitions, 8 changer transitions 1/87 dead transitions. [2025-02-08 08:24:39,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 87 transitions, 580 flow [2025-02-08 08:24:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:24:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:24:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-02-08 08:24:39,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24554455445544554 [2025-02-08 08:24:39,903 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 208 flow. Second operand 5 states and 124 transitions. [2025-02-08 08:24:39,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 87 transitions, 580 flow [2025-02-08 08:24:39,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 550 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:24:39,905 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 240 flow [2025-02-08 08:24:39,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2025-02-08 08:24:39,906 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -11 predicate places. [2025-02-08 08:24:39,906 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 240 flow [2025-02-08 08:24:39,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:39,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:39,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:39,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:24:39,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:39,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash -223764773, now seen corresponding path program 1 times [2025-02-08 08:24:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863648451] [2025-02-08 08:24:39,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:39,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:24:39,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:24:39,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:39,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:40,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:40,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863648451] [2025-02-08 08:24:40,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863648451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:40,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:40,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:24:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822709430] [2025-02-08 08:24:40,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:40,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:24:40,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:40,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:24:40,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:24:40,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:40,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:40,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:40,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:40,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:40,347 INFO L124 PetriNetUnfolderBase]: 1253/2000 cut-off events. [2025-02-08 08:24:40,347 INFO L125 PetriNetUnfolderBase]: For 3227/3227 co-relation queries the response was YES. [2025-02-08 08:24:40,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6321 conditions, 2000 events. 1253/2000 cut-off events. For 3227/3227 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9039 event pairs, 177 based on Foata normal form. 88/2087 useless extension candidates. Maximal degree in co-relation 6298. Up to 648 conditions per place. [2025-02-08 08:24:40,353 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 62 selfloop transitions, 11 changer transitions 1/79 dead transitions. [2025-02-08 08:24:40,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 520 flow [2025-02-08 08:24:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:24:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:24:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2025-02-08 08:24:40,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21122112211221122 [2025-02-08 08:24:40,355 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 240 flow. Second operand 6 states and 128 transitions. [2025-02-08 08:24:40,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 520 flow [2025-02-08 08:24:40,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 79 transitions, 473 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-02-08 08:24:40,360 INFO L231 Difference]: Finished difference. Result has 69 places, 45 transitions, 230 flow [2025-02-08 08:24:40,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=69, PETRI_TRANSITIONS=45} [2025-02-08 08:24:40,360 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2025-02-08 08:24:40,360 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 230 flow [2025-02-08 08:24:40,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:40,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:40,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:40,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:24:40,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:40,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1938528064, now seen corresponding path program 1 times [2025-02-08 08:24:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200775949] [2025-02-08 08:24:40,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:40,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:24:40,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:24:40,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:40,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:40,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:24:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200775949] [2025-02-08 08:24:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200775949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:40,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:24:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044356555] [2025-02-08 08:24:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:24:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:24:40,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:24:40,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:24:40,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-08 08:24:40,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 45 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:40,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:40,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-08 08:24:40,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:40,821 INFO L124 PetriNetUnfolderBase]: 1483/2341 cut-off events. [2025-02-08 08:24:40,821 INFO L125 PetriNetUnfolderBase]: For 4094/4094 co-relation queries the response was YES. [2025-02-08 08:24:40,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 2341 events. 1483/2341 cut-off events. For 4094/4094 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10767 event pairs, 293 based on Foata normal form. 16/2356 useless extension candidates. Maximal degree in co-relation 7421. Up to 1138 conditions per place. [2025-02-08 08:24:40,829 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 44 selfloop transitions, 1 changer transitions 40/90 dead transitions. [2025-02-08 08:24:40,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 628 flow [2025-02-08 08:24:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:24:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:24:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-02-08 08:24:40,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19636963696369636 [2025-02-08 08:24:40,830 INFO L175 Difference]: Start difference. First operand has 69 places, 45 transitions, 230 flow. Second operand 6 states and 119 transitions. [2025-02-08 08:24:40,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 628 flow [2025-02-08 08:24:40,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 483 flow, removed 30 selfloop flow, removed 10 redundant places. [2025-02-08 08:24:40,838 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 152 flow [2025-02-08 08:24:40,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2025-02-08 08:24:40,838 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -11 predicate places. [2025-02-08 08:24:40,838 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 152 flow [2025-02-08 08:24:40,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:40,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:40,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:40,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 08:24:40,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:40,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash -225657726, now seen corresponding path program 2 times [2025-02-08 08:24:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:24:40,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091726537] [2025-02-08 08:24:40,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:24:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:24:40,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:24:40,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:24:40,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:24:40,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:24:40,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:24:40,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:24:40,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:24:40,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:40,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:24:40,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:24:40,946 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:24:40,946 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (59 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2025-02-08 08:24:40,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2025-02-08 08:24:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (24 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2025-02-08 08:24:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2025-02-08 08:24:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2025-02-08 08:24:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:24:40,952 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:41,004 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:24:41,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:24:41,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:24:41 BasicIcfg [2025-02-08 08:24:41,012 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:24:41,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:24:41,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:24:41,012 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:24:41,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:24:15" (3/4) ... [2025-02-08 08:24:41,014 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:24:41,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:24:41,015 INFO L158 Benchmark]: Toolchain (without parser) took 26861.94ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 133.8MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-02-08 08:24:41,015 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:24:41,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.58ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 109.5MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:24:41,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.18ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 107.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:24:41,016 INFO L158 Benchmark]: Boogie Preprocessor took 49.03ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 103.4MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:24:41,016 INFO L158 Benchmark]: IcfgBuilder took 1070.44ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 96.9MB in the end (delta: 6.5MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-02-08 08:24:41,016 INFO L158 Benchmark]: TraceAbstraction took 25287.70ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 96.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-02-08 08:24:41,017 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 5.5GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 756.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:24:41,019 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.58ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 109.5MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.18ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 107.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.03ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 103.4MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1070.44ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 96.9MB in the end (delta: 6.5MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25287.70ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 96.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 5.5GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 756.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2052=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2052=-1, t2053=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2052=-1, t2053=0, t2054=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L825] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L765] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L777] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [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=1, __unbuffered_p0_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L17] 0 __assert_fail ("0", "safe012_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 122 locations, 61 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: 25.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 914 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 908 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1871 IncrementalHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 2 mSDtfsCounter, 1871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=16, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 308 ConstructedInterpolants, 0 QuantifiedInterpolants, 1095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 08:24:41,041 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/safe012_power.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:24:43,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:24:43,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:24:43,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:24:43,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:24:43,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:24:43,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:24:43,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:24:43,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:24:43,993 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:24:43,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:24:43,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:24:43,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:24:43,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:24:43,994 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:24:43,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:24:43,995 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:24:43,996 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:24:43,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:24:43,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:24:43,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:24:43,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:24:43,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:24:43,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:24:43,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:24:43,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:24:43,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:24:43,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:24:43,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:24:43,997 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:24:43,997 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:24:43,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:24:43,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:24:43,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:24:43,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:24:43,998 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2025-02-08 08:24:44,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:24:44,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:24:44,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:24:44,280 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:24:44,281 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:24:44,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2025-02-08 08:24:45,578 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1eb52f763/f4137018c94745e5bdc65028549ef82f/FLAG9de9dc11f [2025-02-08 08:24:45,834 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:24:45,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2025-02-08 08:24:45,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1eb52f763/f4137018c94745e5bdc65028549ef82f/FLAG9de9dc11f [2025-02-08 08:24:46,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1eb52f763/f4137018c94745e5bdc65028549ef82f [2025-02-08 08:24:46,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:24:46,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:24:46,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:24:46,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:24:46,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:24:46,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed4fe19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46, skipping insertion in model container [2025-02-08 08:24:46,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:24:46,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:24:46,416 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:24:46,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:24:46,494 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:24:46,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46 WrapperNode [2025-02-08 08:24:46,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:24:46,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:24:46,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:24:46,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:24:46,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,543 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 175 [2025-02-08 08:24:46,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:24:46,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:24:46,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:24:46,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:24:46,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,587 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2025-02-08 08:24:46,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:24:46,639 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:24:46,639 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:24:46,639 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:24:46,640 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (1/1) ... [2025-02-08 08:24:46,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:24:46,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:46,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:24:46,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:24:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-08 08:24:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:24:46,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:24:46,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:24:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:24:46,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:24:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:24:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:24:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:24:46,690 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:24:46,812 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:24:46,813 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:24:47,296 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:24:47,296 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:24:47,644 WARN L170 LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 08:24:47,771 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:24:47,772 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:24:47,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:24:47 BoogieIcfgContainer [2025-02-08 08:24:47,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:24:47,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:24:47,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:24:47,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:24:47,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:24:46" (1/3) ... [2025-02-08 08:24:47,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc116f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:24:47, skipping insertion in model container [2025-02-08 08:24:47,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:24:46" (2/3) ... [2025-02-08 08:24:47,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc116f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:24:47, skipping insertion in model container [2025-02-08 08:24:47,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:24:47" (3/3) ... [2025-02-08 08:24:47,781 INFO L128 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2025-02-08 08:24:47,790 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:24:47,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe012_power.opt.i that has 4 procedures, 73 locations, 1 initial locations, 0 loop locations, and 33 error locations. [2025-02-08 08:24:47,792 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:24:47,956 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:24:47,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 101 transitions, 214 flow [2025-02-08 08:24:48,023 INFO L124 PetriNetUnfolderBase]: 29/98 cut-off events. [2025-02-08 08:24:48,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:24:48,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 29/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 329 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2025-02-08 08:24:48,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 101 transitions, 214 flow [2025-02-08 08:24:48,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 98 transitions, 205 flow [2025-02-08 08:24:48,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:24:48,044 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;@170f2a03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:24:48,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-08 08:24:48,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:24:48,049 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-08 08:24:48,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:24:48,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:48,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:48,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:48,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash 516547402, now seen corresponding path program 1 times [2025-02-08 08:24:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:24:48,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244391538] [2025-02-08 08:24:48,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:48,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:48,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:48,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:24:48,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:24:48,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:24:48,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:24:48,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:48,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:48,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:24:48,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:24:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:48,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:24:48,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:24:48,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244391538] [2025-02-08 08:24:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244391538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:48,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:24:48,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112598814] [2025-02-08 08:24:48,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:48,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:48,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:24:48,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:48,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:48,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:48,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:48,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:48,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:48,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:54,633 INFO L124 PetriNetUnfolderBase]: 49851/70729 cut-off events. [2025-02-08 08:24:54,633 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-02-08 08:24:54,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139284 conditions, 70729 events. 49851/70729 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 3033. Compared 514436 event pairs, 17323 based on Foata normal form. 2304/46868 useless extension candidates. Maximal degree in co-relation 139273. Up to 35793 conditions per place. [2025-02-08 08:24:55,014 INFO L140 encePairwiseOnDemand]: 54/101 looper letters, 86 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-02-08 08:24:55,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 382 flow [2025-02-08 08:24:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2025-02-08 08:24:55,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66996699669967 [2025-02-08 08:24:55,035 INFO L175 Difference]: Start difference. First operand has 79 places, 98 transitions, 205 flow. Second operand 3 states and 203 transitions. [2025-02-08 08:24:55,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 382 flow [2025-02-08 08:24:55,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 378 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:24:55,041 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 140 flow [2025-02-08 08:24:55,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-02-08 08:24:55,046 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2025-02-08 08:24:55,046 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 140 flow [2025-02-08 08:24:55,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:55,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:55,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:55,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:24:55,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:55,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:55,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:55,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1167192685, now seen corresponding path program 1 times [2025-02-08 08:24:55,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:24:55,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304849485] [2025-02-08 08:24:55,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:55,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:55,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:55,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:24:55,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:24:55,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:24:55,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:24:55,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:55,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:55,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:24:55,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:24:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:55,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:24:55,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:24:55,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304849485] [2025-02-08 08:24:55,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304849485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:55,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:55,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:24:55,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489774492] [2025-02-08 08:24:55,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:55,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:24:55,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:55,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:55,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:55,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:55,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:55,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:55,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:24:58,723 INFO L124 PetriNetUnfolderBase]: 25615/38045 cut-off events. [2025-02-08 08:24:58,723 INFO L125 PetriNetUnfolderBase]: For 4446/4446 co-relation queries the response was YES. [2025-02-08 08:24:58,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77685 conditions, 38045 events. 25615/38045 cut-off events. For 4446/4446 co-relation queries the response was YES. Maximal size of possible extension queue 1530. Compared 266775 event pairs, 24103 based on Foata normal form. 0/29230 useless extension candidates. Maximal degree in co-relation 77673. Up to 35300 conditions per place. [2025-02-08 08:24:58,881 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-08 08:24:58,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 212 flow [2025-02-08 08:24:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:24:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:24:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-08 08:24:58,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2607260726072607 [2025-02-08 08:24:58,884 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 140 flow. Second operand 3 states and 79 transitions. [2025-02-08 08:24:58,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 212 flow [2025-02-08 08:24:58,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:24:58,887 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 122 flow [2025-02-08 08:24:58,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-02-08 08:24:58,888 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2025-02-08 08:24:58,888 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 122 flow [2025-02-08 08:24:58,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:58,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:24:58,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:24:58,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:24:59,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:59,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:24:59,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:24:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1167192684, now seen corresponding path program 1 times [2025-02-08 08:24:59,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:24:59,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139648305] [2025-02-08 08:24:59,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:24:59,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:24:59,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:24:59,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:24:59,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:24:59,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:24:59,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:24:59,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:24:59,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:24:59,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:24:59,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:24:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:24:59,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:24:59,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:24:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139648305] [2025-02-08 08:24:59,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139648305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:24:59,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:24:59,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:24:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7882534] [2025-02-08 08:24:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:24:59,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:24:59,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:24:59,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:24:59,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:24:59,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:24:59,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:24:59,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:24:59,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:24:59,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:00,270 INFO L124 PetriNetUnfolderBase]: 10571/16041 cut-off events. [2025-02-08 08:25:00,270 INFO L125 PetriNetUnfolderBase]: For 863/863 co-relation queries the response was YES. [2025-02-08 08:25:00,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32561 conditions, 16041 events. 10571/16041 cut-off events. For 863/863 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 102259 event pairs, 9707 based on Foata normal form. 430/14930 useless extension candidates. Maximal degree in co-relation 32553. Up to 14688 conditions per place. [2025-02-08 08:25:00,328 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-02-08 08:25:00,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 180 flow [2025-02-08 08:25:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:25:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:25:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-08 08:25:00,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2376237623762376 [2025-02-08 08:25:00,330 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 122 flow. Second operand 3 states and 72 transitions. [2025-02-08 08:25:00,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 180 flow [2025-02-08 08:25:00,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:25:00,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 107 flow [2025-02-08 08:25:00,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2025-02-08 08:25:00,331 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2025-02-08 08:25:00,331 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 107 flow [2025-02-08 08:25:00,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:00,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:00,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:00,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:25:00,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:00,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:00,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:00,533 INFO L85 PathProgramCache]: Analyzing trace with hash 114633312, now seen corresponding path program 1 times [2025-02-08 08:25:00,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:00,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303615531] [2025-02-08 08:25:00,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:25:00,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:00,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:00,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:00,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:25:00,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:25:00,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:25:00,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:25:00,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:25:00,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:25:00,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:25:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:25:00,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:25:00,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:25:00,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303615531] [2025-02-08 08:25:00,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303615531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:25:00,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:25:00,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:25:00,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380694773] [2025-02-08 08:25:00,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:25:00,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:25:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:25:00,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:25:00,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:25:00,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:25:00,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:00,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:25:00,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:25:00,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:01,694 INFO L124 PetriNetUnfolderBase]: 9337/13199 cut-off events. [2025-02-08 08:25:01,694 INFO L125 PetriNetUnfolderBase]: For 656/656 co-relation queries the response was YES. [2025-02-08 08:25:01,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27706 conditions, 13199 events. 9337/13199 cut-off events. For 656/656 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 73827 event pairs, 1115 based on Foata normal form. 0/11946 useless extension candidates. Maximal degree in co-relation 27697. Up to 12003 conditions per place. [2025-02-08 08:25:01,740 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 47 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-02-08 08:25:01,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 251 flow [2025-02-08 08:25:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:25:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:25:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-08 08:25:01,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2025-02-08 08:25:01,742 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 107 flow. Second operand 3 states and 84 transitions. [2025-02-08 08:25:01,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 251 flow [2025-02-08 08:25:01,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:25:01,743 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 128 flow [2025-02-08 08:25:01,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-02-08 08:25:01,744 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2025-02-08 08:25:01,744 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 128 flow [2025-02-08 08:25:01,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:01,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:01,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:01,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:25:01,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:01,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:01,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash 820667618, now seen corresponding path program 1 times [2025-02-08 08:25:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421071474] [2025-02-08 08:25:01,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:25:01,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:01,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:01,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:01,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:25:02,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:25:02,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:25:02,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:25:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:25:02,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:25:02,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:25:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:25:02,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:25:02,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:25:02,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421071474] [2025-02-08 08:25:02,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421071474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:25:02,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:25:02,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:25:02,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924111779] [2025-02-08 08:25:02,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:25:02,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:25:02,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:25:02,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:25:02,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:25:02,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:25:02,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:02,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:25:02,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:25:02,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:03,123 INFO L124 PetriNetUnfolderBase]: 8607/12169 cut-off events. [2025-02-08 08:25:03,123 INFO L125 PetriNetUnfolderBase]: For 1506/1506 co-relation queries the response was YES. [2025-02-08 08:25:03,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27862 conditions, 12169 events. 8607/12169 cut-off events. For 1506/1506 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 67383 event pairs, 875 based on Foata normal form. 0/11516 useless extension candidates. Maximal degree in co-relation 27851. Up to 10972 conditions per place. [2025-02-08 08:25:03,175 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 46 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-02-08 08:25:03,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 266 flow [2025-02-08 08:25:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:25:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:25:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-08 08:25:03,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22772277227722773 [2025-02-08 08:25:03,176 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 128 flow. Second operand 4 states and 92 transitions. [2025-02-08 08:25:03,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 266 flow [2025-02-08 08:25:03,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:25:03,179 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 124 flow [2025-02-08 08:25:03,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-02-08 08:25:03,180 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2025-02-08 08:25:03,180 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 124 flow [2025-02-08 08:25:03,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:03,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:03,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:03,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:25:03,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:03,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:03,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:03,381 INFO L85 PathProgramCache]: Analyzing trace with hash 820667617, now seen corresponding path program 1 times [2025-02-08 08:25:03,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:03,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718880278] [2025-02-08 08:25:03,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:25:03,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:03,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:03,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:03,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:25:03,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:25:03,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:25:03,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:25:03,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:25:03,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:25:03,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:25:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:25:03,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:25:03,554 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:25:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718880278] [2025-02-08 08:25:03,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718880278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:25:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:25:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:25:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135401870] [2025-02-08 08:25:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:25:03,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:25:03,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:25:03,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:25:03,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:25:03,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:25:03,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:03,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:25:03,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:25:03,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:04,759 INFO L124 PetriNetUnfolderBase]: 7877/11139 cut-off events. [2025-02-08 08:25:04,759 INFO L125 PetriNetUnfolderBase]: For 1476/1476 co-relation queries the response was YES. [2025-02-08 08:25:04,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25472 conditions, 11139 events. 7877/11139 cut-off events. For 1476/1476 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 60950 event pairs, 635 based on Foata normal form. 300/10786 useless extension candidates. Maximal degree in co-relation 25461. Up to 9942 conditions per place. [2025-02-08 08:25:04,789 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 45 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-02-08 08:25:04,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 260 flow [2025-02-08 08:25:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:25:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:25:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-08 08:25:04,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22524752475247525 [2025-02-08 08:25:04,790 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 124 flow. Second operand 4 states and 91 transitions. [2025-02-08 08:25:04,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 260 flow [2025-02-08 08:25:04,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 247 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:25:04,792 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 119 flow [2025-02-08 08:25:04,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-02-08 08:25:04,793 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2025-02-08 08:25:04,793 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 119 flow [2025-02-08 08:25:04,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:04,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:04,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:04,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:25:04,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:04,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:04,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash -352592611, now seen corresponding path program 1 times [2025-02-08 08:25:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:04,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159867793] [2025-02-08 08:25:04,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:25:04,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:04,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:05,000 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:05,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:25:05,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:25:05,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:25:05,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:25:05,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:25:05,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:25:05,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:25:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:25:05,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:25:05,141 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:25:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159867793] [2025-02-08 08:25:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159867793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:25:05,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:25:05,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:25:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578278035] [2025-02-08 08:25:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:25:05,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:25:05,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:25:05,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:25:05,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:25:05,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-08 08:25:05,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:05,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:25:05,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-08 08:25:05,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:05,886 INFO L124 PetriNetUnfolderBase]: 7877/12003 cut-off events. [2025-02-08 08:25:05,886 INFO L125 PetriNetUnfolderBase]: For 1287/1287 co-relation queries the response was YES. [2025-02-08 08:25:05,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26335 conditions, 12003 events. 7877/12003 cut-off events. For 1287/1287 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 73595 event pairs, 7229 based on Foata normal form. 336/11686 useless extension candidates. Maximal degree in co-relation 26325. Up to 10986 conditions per place. [2025-02-08 08:25:05,936 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 31 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-02-08 08:25:05,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 183 flow [2025-02-08 08:25:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:25:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:25:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-08 08:25:05,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19801980198019803 [2025-02-08 08:25:05,937 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 119 flow. Second operand 3 states and 60 transitions. [2025-02-08 08:25:05,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 183 flow [2025-02-08 08:25:05,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:25:05,940 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 110 flow [2025-02-08 08:25:05,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=110, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-08 08:25:05,941 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2025-02-08 08:25:05,941 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 110 flow [2025-02-08 08:25:05,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:05,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:05,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:05,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:25:06,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:06,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:06,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:06,142 INFO L85 PathProgramCache]: Analyzing trace with hash -352593617, now seen corresponding path program 1 times [2025-02-08 08:25:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:06,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980498738] [2025-02-08 08:25:06,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:25:06,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:06,145 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:06,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:25:06,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:25:06,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:25:06,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:25:06,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:25:06,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:25:06,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:25:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:25:06,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:25:06,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:25:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980498738] [2025-02-08 08:25:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980498738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:25:06,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:25:06,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:25:06,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915591857] [2025-02-08 08:25:06,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:25:06,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:25:06,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:25:06,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:25:06,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:25:06,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:25:06,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:06,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:25:06,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:25:06,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:07,245 INFO L124 PetriNetUnfolderBase]: 5901/9235 cut-off events. [2025-02-08 08:25:07,246 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2025-02-08 08:25:07,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20247 conditions, 9235 events. 5901/9235 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 56859 event pairs, 739 based on Foata normal form. 336/9062 useless extension candidates. Maximal degree in co-relation 20237. Up to 5149 conditions per place. [2025-02-08 08:25:07,285 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 67 selfloop transitions, 5 changer transitions 1/79 dead transitions. [2025-02-08 08:25:07,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 386 flow [2025-02-08 08:25:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:25:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:25:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-02-08 08:25:07,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2025-02-08 08:25:07,286 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 110 flow. Second operand 4 states and 112 transitions. [2025-02-08 08:25:07,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 386 flow [2025-02-08 08:25:07,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:25:07,288 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 143 flow [2025-02-08 08:25:07,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-02-08 08:25:07,291 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -26 predicate places. [2025-02-08 08:25:07,292 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 143 flow [2025-02-08 08:25:07,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:07,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:07,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:07,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 08:25:07,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:07,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:07,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:07,494 INFO L85 PathProgramCache]: Analyzing trace with hash 476616867, now seen corresponding path program 1 times [2025-02-08 08:25:07,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:07,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1453932263] [2025-02-08 08:25:07,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:25:07,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:07,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:07,496 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:07,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:25:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:25:07,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:25:07,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:25:07,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:25:07,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:25:07,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:25:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:25:07,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:25:07,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:25:07,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453932263] [2025-02-08 08:25:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453932263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:25:07,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:25:07,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:25:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580890498] [2025-02-08 08:25:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:25:07,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:25:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:25:07,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:25:07,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:25:07,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:25:07,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:07,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:25:07,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:25:07,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:08,192 INFO L124 PetriNetUnfolderBase]: 3325/5239 cut-off events. [2025-02-08 08:25:08,192 INFO L125 PetriNetUnfolderBase]: For 1267/1267 co-relation queries the response was YES. [2025-02-08 08:25:08,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13038 conditions, 5239 events. 3325/5239 cut-off events. For 1267/1267 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 28465 event pairs, 445 based on Foata normal form. 248/5218 useless extension candidates. Maximal degree in co-relation 13025. Up to 1825 conditions per place. [2025-02-08 08:25:08,212 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 84 selfloop transitions, 8 changer transitions 1/99 dead transitions. [2025-02-08 08:25:08,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 99 transitions, 524 flow [2025-02-08 08:25:08,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:25:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:25:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-02-08 08:25:08,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28316831683168314 [2025-02-08 08:25:08,213 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 143 flow. Second operand 5 states and 143 transitions. [2025-02-08 08:25:08,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 99 transitions, 524 flow [2025-02-08 08:25:08,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 514 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:25:08,216 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 183 flow [2025-02-08 08:25:08,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2025-02-08 08:25:08,216 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2025-02-08 08:25:08,217 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 183 flow [2025-02-08 08:25:08,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:08,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:08,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:08,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:25:08,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:08,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash -151042966, now seen corresponding path program 1 times [2025-02-08 08:25:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:08,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089253088] [2025-02-08 08:25:08,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:25:08,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:08,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:08,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:08,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:25:08,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:25:08,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:25:08,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:25:08,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:25:08,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:25:08,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:25:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:25:08,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:25:08,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:25:08,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089253088] [2025-02-08 08:25:08,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089253088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:25:08,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:25:08,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:25:08,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756925369] [2025-02-08 08:25:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:25:08,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:25:08,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:25:08,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:25:08,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:25:08,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:25:08,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:08,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:25:08,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:25:08,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:09,015 INFO L124 PetriNetUnfolderBase]: 1923/2933 cut-off events. [2025-02-08 08:25:09,016 INFO L125 PetriNetUnfolderBase]: For 2033/2033 co-relation queries the response was YES. [2025-02-08 08:25:09,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8110 conditions, 2933 events. 1923/2933 cut-off events. For 2033/2033 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13624 event pairs, 389 based on Foata normal form. 100/2872 useless extension candidates. Maximal degree in co-relation 8095. Up to 1036 conditions per place. [2025-02-08 08:25:09,026 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 70 selfloop transitions, 11 changer transitions 1/88 dead transitions. [2025-02-08 08:25:09,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 485 flow [2025-02-08 08:25:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:25:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:25:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-02-08 08:25:09,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23432343234323433 [2025-02-08 08:25:09,027 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 183 flow. Second operand 6 states and 142 transitions. [2025-02-08 08:25:09,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 485 flow [2025-02-08 08:25:09,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 460 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 08:25:09,037 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 197 flow [2025-02-08 08:25:09,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2025-02-08 08:25:09,039 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2025-02-08 08:25:09,039 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 197 flow [2025-02-08 08:25:09,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:09,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:09,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:09,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 08:25:09,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:09,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:09,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1100907774, now seen corresponding path program 1 times [2025-02-08 08:25:09,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:09,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543578609] [2025-02-08 08:25:09,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:25:09,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:09,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:09,244 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:09,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 08:25:09,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:25:09,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:25:09,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:25:09,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:25:09,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:25:09,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:25:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:25:09,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:25:09,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:25:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543578609] [2025-02-08 08:25:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543578609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:25:09,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:25:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:25:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356996473] [2025-02-08 08:25:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:25:09,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:25:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:25:09,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:25:09,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:25:09,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:25:09,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:09,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:25:09,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:25:09,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:09,986 INFO L124 PetriNetUnfolderBase]: 2789/4275 cut-off events. [2025-02-08 08:25:09,986 INFO L125 PetriNetUnfolderBase]: For 3345/3345 co-relation queries the response was YES. [2025-02-08 08:25:09,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11895 conditions, 4275 events. 2789/4275 cut-off events. For 3345/3345 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21587 event pairs, 763 based on Foata normal form. 16/4082 useless extension candidates. Maximal degree in co-relation 11879. Up to 1784 conditions per place. [2025-02-08 08:25:10,000 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 67 selfloop transitions, 7 changer transitions 28/108 dead transitions. [2025-02-08 08:25:10,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 108 transitions, 661 flow [2025-02-08 08:25:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:25:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:25:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2025-02-08 08:25:10,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22913719943422914 [2025-02-08 08:25:10,002 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 197 flow. Second operand 7 states and 162 transitions. [2025-02-08 08:25:10,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 108 transitions, 661 flow [2025-02-08 08:25:10,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 108 transitions, 544 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-08 08:25:10,018 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 198 flow [2025-02-08 08:25:10,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2025-02-08 08:25:10,018 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -16 predicate places. [2025-02-08 08:25:10,018 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 198 flow [2025-02-08 08:25:10,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:10,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:10,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:10,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 08:25:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:10,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:10,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 170241448, now seen corresponding path program 2 times [2025-02-08 08:25:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169971809] [2025-02-08 08:25:10,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:25:10,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:10,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:10,222 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:10,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 08:25:10,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:25:10,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:25:10,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:25:10,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:25:10,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:25:10,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:25:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:25:10,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:25:10,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:25:10,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169971809] [2025-02-08 08:25:10,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169971809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:25:10,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:25:10,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:25:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37771536] [2025-02-08 08:25:10,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:25:10,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:25:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:25:10,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:25:10,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:25:10,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-08 08:25:10,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:10,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:25:10,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-08 08:25:10,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:25:10,823 INFO L124 PetriNetUnfolderBase]: 1671/2609 cut-off events. [2025-02-08 08:25:10,823 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2025-02-08 08:25:10,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6620 conditions, 2609 events. 1671/2609 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12412 event pairs, 157 based on Foata normal form. 16/2540 useless extension candidates. Maximal degree in co-relation 6603. Up to 1150 conditions per place. [2025-02-08 08:25:10,830 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 44 selfloop transitions, 1 changer transitions 53/104 dead transitions. [2025-02-08 08:25:10,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 593 flow [2025-02-08 08:25:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:25:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:25:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-02-08 08:25:10,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2079207920792079 [2025-02-08 08:25:10,832 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 198 flow. Second operand 7 states and 147 transitions. [2025-02-08 08:25:10,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 593 flow [2025-02-08 08:25:10,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 577 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-08 08:25:10,835 INFO L231 Difference]: Finished difference. Result has 69 places, 42 transitions, 159 flow [2025-02-08 08:25:10,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=69, PETRI_TRANSITIONS=42} [2025-02-08 08:25:10,835 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2025-02-08 08:25:10,835 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 159 flow [2025-02-08 08:25:10,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:25:10,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:25:10,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:10,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 08:25:11,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:11,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-08 08:25:11,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:25:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1228674750, now seen corresponding path program 3 times [2025-02-08 08:25:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:25:11,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364507633] [2025-02-08 08:25:11,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:25:11,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:11,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:25:11,039 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:25:11,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 08:25:11,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:25:11,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:25:11,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:25:11,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:25:11,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:25:11,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:25:11,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:25:11,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:25:11,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:25:11,251 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:25:11,251 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:25:11,252 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2025-02-08 08:25:11,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (59 of 61 remaining) [2025-02-08 08:25:11,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2025-02-08 08:25:11,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2025-02-08 08:25:11,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2025-02-08 08:25:11,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2025-02-08 08:25:11,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2025-02-08 08:25:11,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2025-02-08 08:25:11,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (24 of 61 remaining) [2025-02-08 08:25:11,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2025-02-08 08:25:11,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2025-02-08 08:25:11,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 08:25:11,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:25:11,457 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:25:11,522 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:25:11,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:25:11,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:25:11 BasicIcfg [2025-02-08 08:25:11,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:25:11,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:25:11,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:25:11,534 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:25:11,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:24:47" (3/4) ... [2025-02-08 08:25:11,536 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:25:11,537 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:25:11,537 INFO L158 Benchmark]: Toolchain (without parser) took 25396.78ms. Allocated memory was 83.9MB in the beginning and 6.4GB in the end (delta: 6.3GB). Free memory was 56.9MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2025-02-08 08:25:11,537 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 54.1MB in the beginning and 54.1MB in the end (delta: 18.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:25:11,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.66ms. Allocated memory is still 83.9MB. Free memory was 56.7MB in the beginning and 32.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:25:11,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.47ms. Allocated memory is still 83.9MB. Free memory was 32.4MB in the beginning and 30.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:25:11,542 INFO L158 Benchmark]: Boogie Preprocessor took 92.24ms. Allocated memory is still 83.9MB. Free memory was 30.1MB in the beginning and 56.7MB in the end (delta: -26.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2025-02-08 08:25:11,542 INFO L158 Benchmark]: IcfgBuilder took 1134.47ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 56.7MB in the beginning and 63.6MB in the end (delta: -6.9MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2025-02-08 08:25:11,542 INFO L158 Benchmark]: TraceAbstraction took 23758.70ms. Allocated memory was 117.4MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 63.6MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2025-02-08 08:25:11,542 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 6.4GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 121.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:25:11,543 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.17ms. Allocated memory is still 83.9MB. Free memory was 54.1MB in the beginning and 54.1MB in the end (delta: 18.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.66ms. Allocated memory is still 83.9MB. Free memory was 56.7MB in the beginning and 32.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.47ms. Allocated memory is still 83.9MB. Free memory was 32.4MB in the beginning and 30.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 92.24ms. Allocated memory is still 83.9MB. Free memory was 30.1MB in the beginning and 56.7MB in the end (delta: -26.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1134.47ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 56.7MB in the beginning and 63.6MB in the end (delta: -6.9MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23758.70ms. Allocated memory was 117.4MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 63.6MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 6.4GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 121.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2052=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2052=-1, t2053=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2052=-1, t2053=0, t2054=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L825] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L765] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L777] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L17] 0 __assert_fail ("0", "safe012_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 122 locations, 61 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: 23.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 661 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 652 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1387 IncrementalHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 5 mSDtfsCounter, 1387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 910 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1505 ConjunctsInSsa, 59 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-02-08 08:25:11,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample