./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/goblint-regression/28-race_reach_72-funloop_hard_racing.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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:03:44,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:03:44,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:03:44,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:03:44,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:03:44,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:03:44,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:03:44,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:03:44,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:03:44,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:03:44,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:03:44,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:03:44,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:03:44,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:03:44,544 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:03:44,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:03:44,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:03:44,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:03:44,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:03:44,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:03:44,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:03:44,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:03:44,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:03:44,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:03:44,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:03:44,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:03:44,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:03:44,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:03:44,546 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-03-04 10:03:44,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:03:44,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:03:44,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:03:44,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:03:44,769 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:03:44,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-04 10:03:45,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0802a32f7/0b636b25cee440fa94d7f34df04f00c3/FLAG5fcc1f6c9 [2025-03-04 10:03:46,257 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:03:46,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-04 10:03:46,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0802a32f7/0b636b25cee440fa94d7f34df04f00c3/FLAG5fcc1f6c9 [2025-03-04 10:03:46,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0802a32f7/0b636b25cee440fa94d7f34df04f00c3 [2025-03-04 10:03:46,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:03:46,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:03:46,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:03:46,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:03:46,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:03:46,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:46,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2559be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46, skipping insertion in model container [2025-03-04 10:03:46,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:46,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:03:46,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:03:46,843 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:03:46,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:03:46,938 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:03:46,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46 WrapperNode [2025-03-04 10:03:46,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:03:46,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:03:46,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:03:46,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:03:46,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:46,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:46,987 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 320 [2025-03-04 10:03:46,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:03:46,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:03:46,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:03:46,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:03:46,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:46,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:47,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:47,019 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 2, 5, 75]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 0, 5, 60]. The 7 writes are split as follows [0, 1, 0, 6]. [2025-03-04 10:03:47,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:47,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:47,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:47,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:47,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:47,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:47,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:03:47,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:03:47,046 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:03:47,046 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:03:47,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (1/1) ... [2025-03-04 10:03:47,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:03:47,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:03:47,076 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-04 10:03:47,079 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-04 10:03:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:03:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:03:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:03:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:03:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:03:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:03:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:03:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:03:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:03:47,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:03:47,100 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:03:47,219 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:03:47,220 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:03:47,541 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 10:03:47,541 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 10:03:47,612 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:03:47,613 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:03:47,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:03:47,868 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:03:47,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:03:47 BoogieIcfgContainer [2025-03-04 10:03:47,868 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:03:47,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:03:47,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:03:47,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:03:47,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:03:46" (1/3) ... [2025-03-04 10:03:47,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71765f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:03:47, skipping insertion in model container [2025-03-04 10:03:47,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:46" (2/3) ... [2025-03-04 10:03:47,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71765f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:03:47, skipping insertion in model container [2025-03-04 10:03:47,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:03:47" (3/3) ... [2025-03-04 10:03:47,875 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-03-04 10:03:47,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:03:47,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 153 locations, 1 initial locations, 17 loop locations, and 38 error locations. [2025-03-04 10:03:47,889 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:03:47,961 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 10:03:47,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 196 transitions, 399 flow [2025-03-04 10:03:48,060 INFO L124 PetriNetUnfolderBase]: 70/324 cut-off events. [2025-03-04 10:03:48,063 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:03:48,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 324 events. 70/324 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1952 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2025-03-04 10:03:48,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 196 transitions, 399 flow [2025-03-04 10:03:48,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 196 transitions, 399 flow [2025-03-04 10:03:48,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:03:48,094 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;@40a16182, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:03:48,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 10:03:48,100 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:03:48,100 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-04 10:03:48,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:03:48,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:48,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:03:48,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:48,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash 25870240, now seen corresponding path program 1 times [2025-03-04 10:03:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:48,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822129761] [2025-03-04 10:03:48,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:48,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:03:48,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:03:48,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:48,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:48,358 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-04 10:03:48,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822129761] [2025-03-04 10:03:48,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822129761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:48,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:48,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:48,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430070150] [2025-03-04 10:03:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:48,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:48,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:48,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:48,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 196 [2025-03-04 10:03:48,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 196 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-04 10:03:48,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:48,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 196 [2025-03-04 10:03:48,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:48,843 INFO L124 PetriNetUnfolderBase]: 1062/3537 cut-off events. [2025-03-04 10:03:48,843 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:03:48,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5554 conditions, 3537 events. 1062/3537 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 31555 event pairs, 903 based on Foata normal form. 634/3666 useless extension candidates. Maximal degree in co-relation 5387. Up to 2011 conditions per place. [2025-03-04 10:03:48,864 INFO L140 encePairwiseOnDemand]: 157/196 looper letters, 71 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2025-03-04 10:03:48,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 158 transitions, 469 flow [2025-03-04 10:03:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-03-04 10:03:48,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6207482993197279 [2025-03-04 10:03:48,875 INFO L175 Difference]: Start difference. First operand has 156 places, 196 transitions, 399 flow. Second operand 3 states and 365 transitions. [2025-03-04 10:03:48,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 158 transitions, 469 flow [2025-03-04 10:03:48,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 158 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:03:48,903 INFO L231 Difference]: Finished difference. Result has 156 places, 158 transitions, 333 flow [2025-03-04 10:03:48,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=156, PETRI_TRANSITIONS=158} [2025-03-04 10:03:48,908 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 0 predicate places. [2025-03-04 10:03:48,908 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 158 transitions, 333 flow [2025-03-04 10:03:48,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-04 10:03:48,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:48,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:03:48,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:03:48,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:48,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:48,909 INFO L85 PathProgramCache]: Analyzing trace with hash 801955581, now seen corresponding path program 1 times [2025-03-04 10:03:48,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:48,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146809223] [2025-03-04 10:03:48,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:48,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:48,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:03:48,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:03:48,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:48,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146809223] [2025-03-04 10:03:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146809223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:03:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938941718] [2025-03-04 10:03:49,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:49,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:03:49,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:03:49,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:03:49,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:03:49,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:03:49,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:03:49,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:49,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:49,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:03:49,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:03:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:49,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:03:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:49,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938941718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:03:49,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:03:49,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:03:49,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376676701] [2025-03-04 10:03:49,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:03:49,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:03:49,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:49,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:03:49,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:03:49,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 196 [2025-03-04 10:03:49,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 158 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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-04 10:03:49,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:49,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 196 [2025-03-04 10:03:49,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:49,579 INFO L124 PetriNetUnfolderBase]: 1062/3540 cut-off events. [2025-03-04 10:03:49,580 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:03:49,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5570 conditions, 3540 events. 1062/3540 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 31556 event pairs, 903 based on Foata normal form. 0/3035 useless extension candidates. Maximal degree in co-relation 5558. Up to 2011 conditions per place. [2025-03-04 10:03:49,599 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 71 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-03-04 10:03:49,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 161 transitions, 497 flow [2025-03-04 10:03:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:03:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:03:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 589 transitions. [2025-03-04 10:03:49,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5008503401360545 [2025-03-04 10:03:49,606 INFO L175 Difference]: Start difference. First operand has 156 places, 158 transitions, 333 flow. Second operand 6 states and 589 transitions. [2025-03-04 10:03:49,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 161 transitions, 497 flow [2025-03-04 10:03:49,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 161 transitions, 493 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:03:49,613 INFO L231 Difference]: Finished difference. Result has 163 places, 161 transitions, 365 flow [2025-03-04 10:03:49,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=163, PETRI_TRANSITIONS=161} [2025-03-04 10:03:49,614 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 7 predicate places. [2025-03-04 10:03:49,614 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 161 transitions, 365 flow [2025-03-04 10:03:49,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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-04 10:03:49,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:49,615 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:03:49,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:03:49,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:03:49,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:49,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1866060064, now seen corresponding path program 2 times [2025-03-04 10:03:49,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:49,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238315461] [2025-03-04 10:03:49,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:03:49,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:49,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 10:03:49,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-03-04 10:03:49,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:03:49,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:03:49,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:49,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238315461] [2025-03-04 10:03:49,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238315461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:49,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:49,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661850300] [2025-03-04 10:03:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:49,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:49,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:49,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:49,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:49,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 196 [2025-03-04 10:03:49,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 161 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-04 10:03:49,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:49,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 196 [2025-03-04 10:03:49,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:50,339 INFO L124 PetriNetUnfolderBase]: 1108/3606 cut-off events. [2025-03-04 10:03:50,339 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:03:50,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 3606 events. 1108/3606 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 31938 event pairs, 903 based on Foata normal form. 0/3141 useless extension candidates. Maximal degree in co-relation 5706. Up to 2007 conditions per place. [2025-03-04 10:03:50,359 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 98 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2025-03-04 10:03:50,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 181 transitions, 605 flow [2025-03-04 10:03:50,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2025-03-04 10:03:50,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5799319727891157 [2025-03-04 10:03:50,361 INFO L175 Difference]: Start difference. First operand has 163 places, 161 transitions, 365 flow. Second operand 3 states and 341 transitions. [2025-03-04 10:03:50,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 181 transitions, 605 flow [2025-03-04 10:03:50,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 181 transitions, 591 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:03:50,364 INFO L231 Difference]: Finished difference. Result has 162 places, 159 transitions, 351 flow [2025-03-04 10:03:50,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=162, PETRI_TRANSITIONS=159} [2025-03-04 10:03:50,365 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 6 predicate places. [2025-03-04 10:03:50,365 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 159 transitions, 351 flow [2025-03-04 10:03:50,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-04 10:03:50,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:50,365 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:03:50,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:03:50,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:50,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:50,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1866060063, now seen corresponding path program 1 times [2025-03-04 10:03:50,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:50,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454075532] [2025-03-04 10:03:50,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:50,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:50,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:03:50,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:03:50,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:50,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454075532] [2025-03-04 10:03:50,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454075532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:03:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662823332] [2025-03-04 10:03:50,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:03:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:03:50,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:03:50,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:03:50,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:03:50,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:03:50,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:50,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:50,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:03:50,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:03:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:50,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:03:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662823332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:03:50,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:03:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:03:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443321810] [2025-03-04 10:03:50,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:03:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:03:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:50,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:03:50,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:03:50,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 196 [2025-03-04 10:03:50,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 159 transitions, 351 flow. Second operand has 13 states, 13 states have (on average 86.15384615384616) internal successors, (1120), 13 states have internal predecessors, (1120), 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-04 10:03:50,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:50,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 196 [2025-03-04 10:03:50,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:51,030 INFO L124 PetriNetUnfolderBase]: 1062/3522 cut-off events. [2025-03-04 10:03:51,030 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-04 10:03:51,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 3522 events. 1062/3522 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 31186 event pairs, 903 based on Foata normal form. 6/3048 useless extension candidates. Maximal degree in co-relation 5549. Up to 2011 conditions per place. [2025-03-04 10:03:51,046 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 71 selfloop transitions, 11 changer transitions 0/165 dead transitions. [2025-03-04 10:03:51,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 165 transitions, 551 flow [2025-03-04 10:03:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:03:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:03:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1108 transitions. [2025-03-04 10:03:51,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4710884353741497 [2025-03-04 10:03:51,052 INFO L175 Difference]: Start difference. First operand has 162 places, 159 transitions, 351 flow. Second operand 12 states and 1108 transitions. [2025-03-04 10:03:51,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 165 transitions, 551 flow [2025-03-04 10:03:51,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 165 transitions, 547 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:03:51,057 INFO L231 Difference]: Finished difference. Result has 177 places, 165 transitions, 431 flow [2025-03-04 10:03:51,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=431, PETRI_PLACES=177, PETRI_TRANSITIONS=165} [2025-03-04 10:03:51,060 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 21 predicate places. [2025-03-04 10:03:51,061 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 165 transitions, 431 flow [2025-03-04 10:03:51,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.15384615384616) internal successors, (1120), 13 states have internal predecessors, (1120), 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-04 10:03:51,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:51,061 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-03-04 10:03:51,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:03:51,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:03:51,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:51,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2082884033, now seen corresponding path program 2 times [2025-03-04 10:03:51,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:51,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870222676] [2025-03-04 10:03:51,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:03:51,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:51,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:03:51,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-03-04 10:03:51,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:03:51,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:03:51,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870222676] [2025-03-04 10:03:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870222676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:51,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:51,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:51,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493612639] [2025-03-04 10:03:51,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:51,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:51,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:51,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:51,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:51,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 196 [2025-03-04 10:03:51,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 165 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-04 10:03:51,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:51,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 196 [2025-03-04 10:03:51,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:51,713 INFO L124 PetriNetUnfolderBase]: 1037/3283 cut-off events. [2025-03-04 10:03:51,713 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 10:03:51,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5347 conditions, 3283 events. 1037/3283 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 28969 event pairs, 0 based on Foata normal form. 1/2874 useless extension candidates. Maximal degree in co-relation 5271. Up to 1975 conditions per place. [2025-03-04 10:03:51,727 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 104 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-03-04 10:03:51,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 188 transitions, 689 flow [2025-03-04 10:03:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2025-03-04 10:03:51,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-04 10:03:51,728 INFO L175 Difference]: Start difference. First operand has 177 places, 165 transitions, 431 flow. Second operand 3 states and 350 transitions. [2025-03-04 10:03:51,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 188 transitions, 689 flow [2025-03-04 10:03:51,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 188 transitions, 641 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-04 10:03:51,732 INFO L231 Difference]: Finished difference. Result has 175 places, 165 transitions, 393 flow [2025-03-04 10:03:51,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=175, PETRI_TRANSITIONS=165} [2025-03-04 10:03:51,733 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 19 predicate places. [2025-03-04 10:03:51,733 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 165 transitions, 393 flow [2025-03-04 10:03:51,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-04 10:03:51,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:51,733 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:03:51,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:03:51,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:51,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 167646333, now seen corresponding path program 1 times [2025-03-04 10:03:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032375087] [2025-03-04 10:03:51,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:51,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:03:51,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:03:51,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:51,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:03:51,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:51,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032375087] [2025-03-04 10:03:51,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032375087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:51,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:51,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:03:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120401535] [2025-03-04 10:03:51,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:51,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:03:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:51,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:03:51,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:03:51,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 196 [2025-03-04 10:03:51,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 165 transitions, 393 flow. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 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-04 10:03:51,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:51,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 196 [2025-03-04 10:03:51,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:52,079 INFO L124 PetriNetUnfolderBase]: 72/272 cut-off events. [2025-03-04 10:03:52,079 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-04 10:03:52,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 272 events. 72/272 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1114 event pairs, 34 based on Foata normal form. 44/288 useless extension candidates. Maximal degree in co-relation 475. Up to 132 conditions per place. [2025-03-04 10:03:52,081 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 61 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-03-04 10:03:52,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 89 transitions, 360 flow [2025-03-04 10:03:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:03:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:03:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2025-03-04 10:03:52,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49362244897959184 [2025-03-04 10:03:52,083 INFO L175 Difference]: Start difference. First operand has 175 places, 165 transitions, 393 flow. Second operand 4 states and 387 transitions. [2025-03-04 10:03:52,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 89 transitions, 360 flow [2025-03-04 10:03:52,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 89 transitions, 354 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:03:52,085 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 184 flow [2025-03-04 10:03:52,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2025-03-04 10:03:52,085 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, -77 predicate places. [2025-03-04 10:03:52,085 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 184 flow [2025-03-04 10:03:52,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 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-04 10:03:52,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:52,086 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:03:52,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:03:52,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:52,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash 902069856, now seen corresponding path program 1 times [2025-03-04 10:03:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556382109] [2025-03-04 10:03:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:52,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:03:52,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:03:52,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:52,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:03:52,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:03:52,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:03:52,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:03:52,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:52,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:03:52,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:03:52,156 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:03:52,156 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-03-04 10:03:52,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-03-04 10:03:52,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-03-04 10:03:52,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-03-04 10:03:52,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-03-04 10:03:52,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (44 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-03-04 10:03:52,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (23 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (22 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-03-04 10:03:52,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-03-04 10:03:52,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-03-04 10:03:52,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-03-04 10:03:52,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-03-04 10:03:52,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-03-04 10:03:52,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-03-04 10:03:52,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2025-03-04 10:03:52,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:03:52,163 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-04 10:03:52,165 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 10:03:52,165 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 10:03:52,194 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:03:52,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 258 transitions, 532 flow [2025-03-04 10:03:52,223 INFO L124 PetriNetUnfolderBase]: 113/526 cut-off events. [2025-03-04 10:03:52,224 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:03:52,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 526 events. 113/526 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3453 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 326. Up to 12 conditions per place. [2025-03-04 10:03:52,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 258 transitions, 532 flow [2025-03-04 10:03:52,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 258 transitions, 532 flow [2025-03-04 10:03:52,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:03:52,231 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;@40a16182, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:03:52,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-04 10:03:52,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:03:52,233 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-04 10:03:52,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:03:52,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:52,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:03:52,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:03:52,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 33812512, now seen corresponding path program 1 times [2025-03-04 10:03:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:52,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890781574] [2025-03-04 10:03:52,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:52,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:03:52,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:03:52,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:52,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:52,265 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-04 10:03:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:52,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890781574] [2025-03-04 10:03:52,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890781574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:52,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661080980] [2025-03-04 10:03:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:52,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:52,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:52,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:52,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2025-03-04 10:03:52,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 258 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-04 10:03:52,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:52,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2025-03-04 10:03:52,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:57,561 INFO L124 PetriNetUnfolderBase]: 46715/102981 cut-off events. [2025-03-04 10:03:57,561 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-03-04 10:03:57,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170651 conditions, 102981 events. 46715/102981 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 3066. Compared 1244947 event pairs, 41202 based on Foata normal form. 21485/111204 useless extension candidates. Maximal degree in co-relation 164810. Up to 67552 conditions per place. [2025-03-04 10:03:58,097 INFO L140 encePairwiseOnDemand]: 207/258 looper letters, 95 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2025-03-04 10:03:58,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 207 transitions, 624 flow [2025-03-04 10:03:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2025-03-04 10:03:58,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6149870801033591 [2025-03-04 10:03:58,100 INFO L175 Difference]: Start difference. First operand has 205 places, 258 transitions, 532 flow. Second operand 3 states and 476 transitions. [2025-03-04 10:03:58,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 207 transitions, 624 flow [2025-03-04 10:03:58,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 207 transitions, 624 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:03:58,104 INFO L231 Difference]: Finished difference. Result has 204 places, 207 transitions, 440 flow [2025-03-04 10:03:58,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=204, PETRI_TRANSITIONS=207} [2025-03-04 10:03:58,106 INFO L279 CegarLoopForPetriNet]: 205 programPoint places, -1 predicate places. [2025-03-04 10:03:58,106 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 207 transitions, 440 flow [2025-03-04 10:03:58,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-04 10:03:58,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:58,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:03:58,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:03:58,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:03:58,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1048166271, now seen corresponding path program 1 times [2025-03-04 10:03:58,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:58,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171902223] [2025-03-04 10:03:58,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:58,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:03:58,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:03:58,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:58,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171902223] [2025-03-04 10:03:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171902223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:03:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932812036] [2025-03-04 10:03:58,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:58,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:03:58,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:03:58,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:03:58,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:03:58,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:03:58,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:03:58,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:58,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:58,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:03:58,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:03:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:58,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:03:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932812036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:03:58,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:03:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:03:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297050327] [2025-03-04 10:03:58,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:03:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:03:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:58,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:03:58,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:03:58,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2025-03-04 10:03:58,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 207 transitions, 440 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 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-04 10:03:58,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:58,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2025-03-04 10:03:58,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:03,733 INFO L124 PetriNetUnfolderBase]: 46715/102984 cut-off events. [2025-03-04 10:04:03,733 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-03-04 10:04:03,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170667 conditions, 102984 events. 46715/102984 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 3067. Compared 1245100 event pairs, 41202 based on Foata normal form. 0/89722 useless extension candidates. Maximal degree in co-relation 170654. Up to 67552 conditions per place. [2025-03-04 10:04:04,324 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 95 selfloop transitions, 5 changer transitions 0/210 dead transitions. [2025-03-04 10:04:04,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 210 transitions, 652 flow [2025-03-04 10:04:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:04:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:04:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2025-03-04 10:04:04,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4928940568475452 [2025-03-04 10:04:04,327 INFO L175 Difference]: Start difference. First operand has 204 places, 207 transitions, 440 flow. Second operand 6 states and 763 transitions. [2025-03-04 10:04:04,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 210 transitions, 652 flow [2025-03-04 10:04:04,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 210 transitions, 648 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:04:04,330 INFO L231 Difference]: Finished difference. Result has 211 places, 210 transitions, 472 flow [2025-03-04 10:04:04,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=211, PETRI_TRANSITIONS=210} [2025-03-04 10:04:04,331 INFO L279 CegarLoopForPetriNet]: 205 programPoint places, 6 predicate places. [2025-03-04 10:04:04,331 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 210 transitions, 472 flow [2025-03-04 10:04:04,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 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-04 10:04:04,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:04,332 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:04:04,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:04:04,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:04:04,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:04:04,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:04,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1487687648, now seen corresponding path program 2 times [2025-03-04 10:04:04,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:04,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171875756] [2025-03-04 10:04:04,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:04:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:04,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 10:04:04,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-03-04 10:04:04,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:04:04,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:04:04,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:04,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171875756] [2025-03-04 10:04:04,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171875756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:04,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:04,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:04,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395791396] [2025-03-04 10:04:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:04,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:04,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:04,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:04,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:04,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 258 [2025-03-04 10:04:04,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 210 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-04 10:04:04,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:04,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 258 [2025-03-04 10:04:04,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:10,173 INFO L124 PetriNetUnfolderBase]: 48766/106196 cut-off events. [2025-03-04 10:04:10,174 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-04 10:04:10,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176966 conditions, 106196 events. 48766/106196 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 3107. Compared 1276754 event pairs, 41181 based on Foata normal form. 0/93167 useless extension candidates. Maximal degree in co-relation 176931. Up to 67491 conditions per place. [2025-03-04 10:04:10,918 INFO L140 encePairwiseOnDemand]: 254/258 looper letters, 144 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2025-03-04 10:04:10,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 252 transitions, 848 flow [2025-03-04 10:04:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2025-03-04 10:04:10,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2025-03-04 10:04:10,920 INFO L175 Difference]: Start difference. First operand has 211 places, 210 transitions, 472 flow. Second operand 3 states and 462 transitions. [2025-03-04 10:04:10,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 252 transitions, 848 flow [2025-03-04 10:04:10,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 252 transitions, 834 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:04:10,923 INFO L231 Difference]: Finished difference. Result has 210 places, 208 transitions, 458 flow [2025-03-04 10:04:10,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=210, PETRI_TRANSITIONS=208} [2025-03-04 10:04:10,924 INFO L279 CegarLoopForPetriNet]: 205 programPoint places, 5 predicate places. [2025-03-04 10:04:10,924 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 208 transitions, 458 flow [2025-03-04 10:04:10,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-04 10:04:10,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:10,924 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:04:10,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:04:10,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:04:10,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:10,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1487687649, now seen corresponding path program 1 times [2025-03-04 10:04:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:10,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559396104] [2025-03-04 10:04:10,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:10,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:10,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:04:10,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:04:10,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:10,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:04:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559396104] [2025-03-04 10:04:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559396104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:04:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607096403] [2025-03-04 10:04:10,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:10,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:04:10,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:04:10,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:04:10,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:04:11,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:04:11,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:04:11,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:11,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:11,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:04:11,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:04:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:04:11,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:04:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:04:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607096403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:04:11,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:04:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:04:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575061894] [2025-03-04 10:04:11,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:04:11,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:04:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:11,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:04:11,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:04:11,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2025-03-04 10:04:11,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 208 transitions, 458 flow. Second operand has 13 states, 13 states have (on average 111.15384615384616) internal successors, (1445), 13 states have internal predecessors, (1445), 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-04 10:04:11,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:11,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2025-03-04 10:04:11,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:17,352 INFO L124 PetriNetUnfolderBase]: 46715/102684 cut-off events. [2025-03-04 10:04:17,352 INFO L125 PetriNetUnfolderBase]: For 479/479 co-relation queries the response was YES. [2025-03-04 10:04:17,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170922 conditions, 102684 events. 46715/102684 cut-off events. For 479/479 co-relation queries the response was YES. Maximal size of possible extension queue 3049. Compared 1237925 event pairs, 41202 based on Foata normal form. 6/89735 useless extension candidates. Maximal degree in co-relation 170869. Up to 67552 conditions per place. [2025-03-04 10:04:17,977 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 95 selfloop transitions, 11 changer transitions 0/214 dead transitions. [2025-03-04 10:04:17,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 214 transitions, 706 flow [2025-03-04 10:04:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:04:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:04:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1432 transitions. [2025-03-04 10:04:17,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625322997416021 [2025-03-04 10:04:17,988 INFO L175 Difference]: Start difference. First operand has 210 places, 208 transitions, 458 flow. Second operand 12 states and 1432 transitions. [2025-03-04 10:04:17,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 214 transitions, 706 flow [2025-03-04 10:04:18,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 214 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:18,014 INFO L231 Difference]: Finished difference. Result has 225 places, 214 transitions, 538 flow [2025-03-04 10:04:18,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=538, PETRI_PLACES=225, PETRI_TRANSITIONS=214} [2025-03-04 10:04:18,015 INFO L279 CegarLoopForPetriNet]: 205 programPoint places, 20 predicate places. [2025-03-04 10:04:18,016 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 214 transitions, 538 flow [2025-03-04 10:04:18,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 111.15384615384616) internal successors, (1445), 13 states have internal predecessors, (1445), 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-04 10:04:18,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:18,017 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-03-04 10:04:18,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:04:18,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:04:18,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:04:18,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:18,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1273046143, now seen corresponding path program 2 times [2025-03-04 10:04:18,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:18,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397272775] [2025-03-04 10:04:18,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:04:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:18,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:04:18,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-03-04 10:04:18,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:04:18,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:04:18,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:18,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397272775] [2025-03-04 10:04:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397272775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:18,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:18,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:18,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509262873] [2025-03-04 10:04:18,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:18,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:18,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:18,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:18,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 258 [2025-03-04 10:04:18,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 214 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-04 10:04:18,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:18,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 258 [2025-03-04 10:04:18,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand