./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/thin002_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/thin002_rmo.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:11:13,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:11:14,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:11:14,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:11:14,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:11:14,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:11:14,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:11:14,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:11:14,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:11:14,049 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:11:14,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:11:14,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:11:14,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:11:14,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:11:14,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:11:14,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:11:14,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:11:14,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:11:14,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:11:14,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:11:14,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:11:14,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:11:14,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:11:14,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:11:14,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:11:14,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:11:14,051 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/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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 [2025-03-09 01:11:14,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:11:14,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:11:14,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:11:14,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:11:14,319 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:11:14,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2025-03-09 01:11:15,563 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912321497/f96f3973b6e84dd59d1c9aefec0aee5b/FLAG6a86d5d68 [2025-03-09 01:11:15,861 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:11:15,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2025-03-09 01:11:15,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912321497/f96f3973b6e84dd59d1c9aefec0aee5b/FLAG6a86d5d68 [2025-03-09 01:11:15,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912321497/f96f3973b6e84dd59d1c9aefec0aee5b [2025-03-09 01:11:15,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:11:15,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:11:15,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:11:15,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:11:15,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:11:15,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:11:15" (1/1) ... [2025-03-09 01:11:15,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c457ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:15, skipping insertion in model container [2025-03-09 01:11:15,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:11:15" (1/1) ... [2025-03-09 01:11:15,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:11:16,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:11:16,235 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:11:16,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:11:16,319 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:11:16,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16 WrapperNode [2025-03-09 01:11:16,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:11:16,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:11:16,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:11:16,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:11:16,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,370 INFO L138 Inliner]: procedures = 176, calls = 65, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2025-03-09 01:11:16,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:11:16,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:11:16,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:11:16,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:11:16,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,395 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 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-03-09 01:11:16,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:11:16,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:11:16,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:11:16,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:11:16,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (1/1) ... [2025-03-09 01:11:16,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:11:16,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:11:16,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:11:16,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:11:16,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:11:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:11:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:11:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:11:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:11:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:11:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 01:11:16,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 01:11:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 01:11:16,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 01:11:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-09 01:11:16,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-09 01:11:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-09 01:11:16,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-09 01:11:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:11:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:11:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:11:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:11:16,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:11:16,477 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:11:16,597 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:11:16,599 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:11:16,950 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:11:16,950 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:11:17,243 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:11:17,243 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:11:17,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:11:17 BoogieIcfgContainer [2025-03-09 01:11:17,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:11:17,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:11:17,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:11:17,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:11:17,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:11:15" (1/3) ... [2025-03-09 01:11:17,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de9208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:11:17, skipping insertion in model container [2025-03-09 01:11:17,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:11:16" (2/3) ... [2025-03-09 01:11:17,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de9208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:11:17, skipping insertion in model container [2025-03-09 01:11:17,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:11:17" (3/3) ... [2025-03-09 01:11:17,250 INFO L128 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2025-03-09 01:11:17,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:11:17,263 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thin002_rmo.i that has 5 procedures, 75 locations, 1 initial locations, 0 loop locations, and 26 error locations. [2025-03-09 01:11:17,263 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:11:17,335 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:11:17,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 76 transitions, 168 flow [2025-03-09 01:11:17,446 INFO L124 PetriNetUnfolderBase]: 2/72 cut-off events. [2025-03-09 01:11:17,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:17,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 242 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2025-03-09 01:11:17,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 76 transitions, 168 flow [2025-03-09 01:11:17,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 72 transitions, 156 flow [2025-03-09 01:11:17,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:11:17,484 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;@15b9b97a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:11:17,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-03-09 01:11:17,488 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:11:17,488 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-09 01:11:17,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:17,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:17,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:11:17,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-09 01:11:17,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash 19945535, now seen corresponding path program 1 times [2025-03-09 01:11:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:17,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31124609] [2025-03-09 01:11:17,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:17,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:17,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:11:17,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:11:17,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:17,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:11:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:17,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31124609] [2025-03-09 01:11:17,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31124609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:17,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:17,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:11:17,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746493345] [2025-03-09 01:11:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:17,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:11:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:17,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:11:17,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:11:17,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 76 [2025-03-09 01:11:17,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:17,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:17,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 76 [2025-03-09 01:11:17,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:27,447 INFO L124 PetriNetUnfolderBase]: 107519/148498 cut-off events. [2025-03-09 01:11:27,447 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2025-03-09 01:11:27,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288982 conditions, 148498 events. 107519/148498 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 4904. Compared 1051579 event pairs, 107519 based on Foata normal form. 4536/128432 useless extension candidates. Maximal degree in co-relation 288970. Up to 139874 conditions per place. [2025-03-09 01:11:28,426 INFO L140 encePairwiseOnDemand]: 57/76 looper letters, 44 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2025-03-09 01:11:28,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 53 transitions, 208 flow [2025-03-09 01:11:28,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:11:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:11:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-09 01:11:28,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2025-03-09 01:11:28,437 INFO L175 Difference]: Start difference. First operand has 83 places, 72 transitions, 156 flow. Second operand 3 states and 99 transitions. [2025-03-09 01:11:28,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 53 transitions, 208 flow [2025-03-09 01:11:28,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:11:28,448 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 116 flow [2025-03-09 01:11:28,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2025-03-09 01:11:28,452 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -19 predicate places. [2025-03-09 01:11:28,452 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 116 flow [2025-03-09 01:11:28,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:28,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:28,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:11:28,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:11:28,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-09 01:11:28,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash 19945536, now seen corresponding path program 1 times [2025-03-09 01:11:28,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:28,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002384954] [2025-03-09 01:11:28,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:28,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:28,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:11:28,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:11:28,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:28,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:11:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:28,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002384954] [2025-03-09 01:11:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002384954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:28,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:28,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:11:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613825839] [2025-03-09 01:11:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:28,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:11:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:28,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:11:28,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:11:28,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 76 [2025-03-09 01:11:28,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:28,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:28,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 76 [2025-03-09 01:11:28,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:32,915 INFO L124 PetriNetUnfolderBase]: 51755/72623 cut-off events. [2025-03-09 01:11:32,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:33,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140969 conditions, 72623 events. 51755/72623 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2323. Compared 486671 event pairs, 51755 based on Foata normal form. 0/69754 useless extension candidates. Maximal degree in co-relation 140963. Up to 67824 conditions per place. [2025-03-09 01:11:33,250 INFO L140 encePairwiseOnDemand]: 69/76 looper letters, 37 selfloop transitions, 1 changer transitions 1/47 dead transitions. [2025-03-09 01:11:33,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 182 flow [2025-03-09 01:11:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:11:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:11:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-09 01:11:33,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2025-03-09 01:11:33,252 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 116 flow. Second operand 3 states and 81 transitions. [2025-03-09 01:11:33,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 182 flow [2025-03-09 01:11:33,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 47 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:11:33,254 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 103 flow [2025-03-09 01:11:33,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2025-03-09 01:11:33,255 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2025-03-09 01:11:33,255 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 103 flow [2025-03-09 01:11:33,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:33,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:33,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:11:33,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:11:33,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-09 01:11:33,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1698704967, now seen corresponding path program 1 times [2025-03-09 01:11:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:33,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054467899] [2025-03-09 01:11:33,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:33,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:11:33,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:11:33,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:33,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:33,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-03-09 01:11:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:33,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054467899] [2025-03-09 01:11:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054467899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:11:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640267975] [2025-03-09 01:11:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:33,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:11:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:33,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:11:33,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:11:33,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 76 [2025-03-09 01:11:33,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:33,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:33,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 76 [2025-03-09 01:11:33,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:36,806 INFO L124 PetriNetUnfolderBase]: 45923/61066 cut-off events. [2025-03-09 01:11:36,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:11:36,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121853 conditions, 61066 events. 45923/61066 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1924. Compared 373953 event pairs, 6503 based on Foata normal form. 0/58859 useless extension candidates. Maximal degree in co-relation 121846. Up to 53459 conditions per place. [2025-03-09 01:11:37,107 INFO L140 encePairwiseOnDemand]: 72/76 looper letters, 65 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-09 01:11:37,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 301 flow [2025-03-09 01:11:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:11:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:11:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-09 01:11:37,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2025-03-09 01:11:37,108 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-03-09 01:11:37,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 301 flow [2025-03-09 01:11:37,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:11:37,110 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 112 flow [2025-03-09 01:11:37,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2025-03-09 01:11:37,111 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -23 predicate places. [2025-03-09 01:11:37,111 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 112 flow [2025-03-09 01:11:37,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:11:37,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:37,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:11:37,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:11:37,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-09 01:11:37,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash 367957850, now seen corresponding path program 1 times [2025-03-09 01:11:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326876689] [2025-03-09 01:11:37,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:37,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:11:37,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:11:37,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:37,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:11:37,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:37,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326876689] [2025-03-09 01:11:37,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326876689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:37,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:37,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:11:37,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796447695] [2025-03-09 01:11:37,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:37,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:11:37,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:37,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:11:37,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:11:37,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 76 [2025-03-09 01:11:37,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-03-09 01:11:37,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:37,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 76 [2025-03-09 01:11:37,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:11:41,033 INFO L124 PetriNetUnfolderBase]: 42359/56422 cut-off events. [2025-03-09 01:11:41,033 INFO L125 PetriNetUnfolderBase]: For 2894/2894 co-relation queries the response was YES. [2025-03-09 01:11:41,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117707 conditions, 56422 events. 42359/56422 cut-off events. For 2894/2894 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 345486 event pairs, 5639 based on Foata normal form. 0/56375 useless extension candidates. Maximal degree in co-relation 117698. Up to 48814 conditions per place. [2025-03-09 01:11:41,297 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 64 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-03-09 01:11:41,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 304 flow [2025-03-09 01:11:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:11:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:11:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-09 01:11:41,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3782894736842105 [2025-03-09 01:11:41,299 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 112 flow. Second operand 4 states and 115 transitions. [2025-03-09 01:11:41,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 304 flow [2025-03-09 01:11:41,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:11:41,304 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 108 flow [2025-03-09 01:11:41,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2025-03-09 01:11:41,305 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -23 predicate places. [2025-03-09 01:11:41,305 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 108 flow [2025-03-09 01:11:41,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-03-09 01:11:41,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:11:41,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:11:41,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:11:41,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-09 01:11:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:11:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 171875409, now seen corresponding path program 1 times [2025-03-09 01:11:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:11:41,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273261277] [2025-03-09 01:11:41,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:11:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:11:41,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:11:41,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:11:41,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:11:41,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:11:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:11:41,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:11:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273261277] [2025-03-09 01:11:41,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273261277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:11:41,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:11:41,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:11:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242838691] [2025-03-09 01:11:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:11:41,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:11:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:11:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:11:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:11:41,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 76 [2025-03-09 01:11:41,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-03-09 01:11:41,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:11:41,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 76 [2025-03-09 01:11:41,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand