./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.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 e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:35:44,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:35:44,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:35:44,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:35:44,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:35:44,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:35:44,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:35:44,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:35:44,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:35:44,949 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:35:44,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:35:44,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:35:44,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:35:44,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:35:44,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:35:44,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:35:44,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:35:44,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:35:44,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:35:44,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:35:44,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:35:44,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:44,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:44,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:44,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:44,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:44,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:35:44,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:35:44,952 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 -> e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a [2025-04-30 10:35:45,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:35:45,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:35:45,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:35:45,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:35:45,205 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:35:45,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i [2025-04-30 10:35:46,524 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2ae403c/54d57c3fab884512b20c14af0f505f89/FLAG082bd7486 [2025-04-30 10:35:46,777 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:35:46,778 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i [2025-04-30 10:35:46,791 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2ae403c/54d57c3fab884512b20c14af0f505f89/FLAG082bd7486 [2025-04-30 10:35:47,526 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2ae403c/54d57c3fab884512b20c14af0f505f89 [2025-04-30 10:35:47,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:35:47,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:35:47,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:47,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:35:47,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:35:47,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:47" (1/1) ... [2025-04-30 10:35:47,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47441c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:47, skipping insertion in model container [2025-04-30 10:35:47,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:47" (1/1) ... [2025-04-30 10:35:47,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:35:47,917 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:47,942 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:35:47,998 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:48,057 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:35:48,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48 WrapperNode [2025-04-30 10:35:48,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:48,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:48,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:35:48,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:35:48,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,121 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 180 [2025-04-30 10:35:48,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:48,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:35:48,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:35:48,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:35:48,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,164 INFO L175 MemorySlicer]: Split 78 memory accesses to 2 slices as follows [64, 14]. 82 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60, 0]. The 11 writes are split as follows [1, 10]. [2025-04-30 10:35:48,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:35:48,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:35:48,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:35:48,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:35:48,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (1/1) ... [2025-04-30 10:35:48,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:48,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:48,212 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-04-30 10:35:48,218 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-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:35:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:35:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:35:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:35:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:35:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:35:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:35:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:35:48,235 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:35:48,363 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:35:48,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:35:48,750 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:35:48,750 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:35:49,056 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:35:49,057 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:35:49,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:49 BoogieIcfgContainer [2025-04-30 10:35:49,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:35:49,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:35:49,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:35:49,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:35:49,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:35:47" (1/3) ... [2025-04-30 10:35:49,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9217f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:49, skipping insertion in model container [2025-04-30 10:35:49,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:48" (2/3) ... [2025-04-30 10:35:49,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9217f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:49, skipping insertion in model container [2025-04-30 10:35:49,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:49" (3/3) ... [2025-04-30 10:35:49,066 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2025-04-30 10:35:49,078 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:35:49,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr.i that has 2 procedures, 72 locations, 72 edges, 1 initial locations, 2 loop locations, and 37 error locations. [2025-04-30 10:35:49,079 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:35:49,131 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:35:49,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 73 transitions, 150 flow [2025-04-30 10:35:49,207 INFO L116 PetriNetUnfolderBase]: 2/72 cut-off events. [2025-04-30 10:35:49,209 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:49,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 275 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-04-30 10:35:49,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 73 transitions, 150 flow [2025-04-30 10:35:49,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 72 transitions, 147 flow [2025-04-30 10:35:49,223 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:35:49,234 INFO L340 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;@1d1ef47e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:35:49,235 INFO L341 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-04-30 10:35:49,242 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:35:49,242 INFO L116 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-04-30 10:35:49,243 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:49,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:49,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-30 10:35:49,244 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:49,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 15865722, now seen corresponding path program 1 times [2025-04-30 10:35:49,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:49,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727416269] [2025-04-30 10:35:49,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:49,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:35:49,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:35:49,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:49,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:49,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:49,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727416269] [2025-04-30 10:35:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727416269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:49,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:49,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404389310] [2025-04-30 10:35:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:49,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:49,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:49,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:49,494 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-04-30 10:35:49,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-04-30 10:35:49,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:49,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-04-30 10:35:49,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:49,603 INFO L116 PetriNetUnfolderBase]: 65/268 cut-off events. [2025-04-30 10:35:49,603 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:49,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 268 events. 65/268 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1366 event pairs, 63 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 376. Up to 155 conditions per place. [2025-04-30 10:35:49,606 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-04-30 10:35:49,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 207 flow [2025-04-30 10:35:49,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-04-30 10:35:49,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7534246575342466 [2025-04-30 10:35:49,615 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 147 flow. Second operand 3 states and 165 transitions. [2025-04-30 10:35:49,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 207 flow [2025-04-30 10:35:49,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:49,621 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 158 flow [2025-04-30 10:35:49,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-04-30 10:35:49,626 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2025-04-30 10:35:49,626 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 158 flow [2025-04-30 10:35:49,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-04-30 10:35:49,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:49,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:35:49,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:35:49,627 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:49,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash 491836529, now seen corresponding path program 1 times [2025-04-30 10:35:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:49,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758702374] [2025-04-30 10:35:49,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:49,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:35:49,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:35:49,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:49,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:49,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:49,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758702374] [2025-04-30 10:35:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758702374] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:49,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997861537] [2025-04-30 10:35:49,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:49,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:49,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:49,737 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-04-30 10:35:49,738 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-04-30 10:35:49,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:35:49,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:35:49,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:49,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:49,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:35:49,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:49,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:49,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997861537] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:49,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:49,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-30 10:35:49,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574748201] [2025-04-30 10:35:49,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:49,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:49,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:49,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:49,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:49,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-04-30 10:35:49,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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-04-30 10:35:49,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:49,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-04-30 10:35:49,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:50,006 INFO L116 PetriNetUnfolderBase]: 65/271 cut-off events. [2025-04-30 10:35:50,006 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:50,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 271 events. 65/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1366 event pairs, 63 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 432. Up to 155 conditions per place. [2025-04-30 10:35:50,010 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-04-30 10:35:50,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 234 flow [2025-04-30 10:35:50,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:35:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:35:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 305 transitions. [2025-04-30 10:35:50,014 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6963470319634704 [2025-04-30 10:35:50,015 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 158 flow. Second operand 6 states and 305 transitions. [2025-04-30 10:35:50,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 234 flow [2025-04-30 10:35:50,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:50,017 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 190 flow [2025-04-30 10:35:50,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2025-04-30 10:35:50,017 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2025-04-30 10:35:50,017 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 190 flow [2025-04-30 10:35:50,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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-04-30 10:35:50,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:50,018 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-04-30 10:35:50,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:35:50,218 WARN L466 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-04-30 10:35:50,219 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:50,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2127225542, now seen corresponding path program 2 times [2025-04-30 10:35:50,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:50,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079494525] [2025-04-30 10:35:50,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:50,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-30 10:35:50,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-04-30 10:35:50,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:35:50,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:35:50,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:50,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079494525] [2025-04-30 10:35:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079494525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:50,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:50,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470381108] [2025-04-30 10:35:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:50,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:50,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:50,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:50,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:50,342 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 73 [2025-04-30 10:35:50,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-04-30 10:35:50,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:50,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 73 [2025-04-30 10:35:50,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:50,413 INFO L116 PetriNetUnfolderBase]: 65/267 cut-off events. [2025-04-30 10:35:50,413 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:35:50,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 267 events. 65/267 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1320 event pairs, 63 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 421. Up to 157 conditions per place. [2025-04-30 10:35:50,416 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 30 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-04-30 10:35:50,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 250 flow [2025-04-30 10:35:50,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-04-30 10:35:50,420 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6894977168949772 [2025-04-30 10:35:50,420 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 190 flow. Second operand 3 states and 151 transitions. [2025-04-30 10:35:50,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 250 flow [2025-04-30 10:35:50,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 236 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:50,422 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 176 flow [2025-04-30 10:35:50,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-04-30 10:35:50,422 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2025-04-30 10:35:50,422 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 176 flow [2025-04-30 10:35:50,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-04-30 10:35:50,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:50,423 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-04-30 10:35:50,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:35:50,423 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:50,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2127225541, now seen corresponding path program 1 times [2025-04-30 10:35:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:50,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431139454] [2025-04-30 10:35:50,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:50,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:35:50,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:35:50,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:50,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:50,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431139454] [2025-04-30 10:35:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431139454] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:50,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364013928] [2025-04-30 10:35:50,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:50,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:50,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:50,548 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-04-30 10:35:50,550 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-04-30 10:35:50,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:35:50,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:35:50,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:50,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:50,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:35:50,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:50,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:50,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364013928] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:50,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:50,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-30 10:35:50,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108876167] [2025-04-30 10:35:50,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:50,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:35:50,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:50,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:35:50,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:35:50,694 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-04-30 10:35:50,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 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-04-30 10:35:50,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:50,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-04-30 10:35:50,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:50,808 INFO L116 PetriNetUnfolderBase]: 65/273 cut-off events. [2025-04-30 10:35:50,809 INFO L117 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-04-30 10:35:50,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 273 events. 65/273 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1315 event pairs, 63 based on Foata normal form. 6/221 useless extension candidates. Maximal degree in co-relation 431. Up to 155 conditions per place. [2025-04-30 10:35:50,811 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2025-04-30 10:35:50,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 78 transitions, 288 flow [2025-04-30 10:35:50,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:35:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:35:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 584 transitions. [2025-04-30 10:35:50,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-30 10:35:50,815 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 176 flow. Second operand 12 states and 584 transitions. [2025-04-30 10:35:50,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 78 transitions, 288 flow [2025-04-30 10:35:50,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 78 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:50,818 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 252 flow [2025-04-30 10:35:50,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=252, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-04-30 10:35:50,820 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2025-04-30 10:35:50,820 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 252 flow [2025-04-30 10:35:50,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 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-04-30 10:35:50,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:50,821 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-04-30 10:35:50,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:35:51,021 WARN L466 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-04-30 10:35:51,021 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:51,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash 909771227, now seen corresponding path program 2 times [2025-04-30 10:35:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:51,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764032988] [2025-04-30 10:35:51,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:51,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:51,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-30 10:35:51,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-04-30 10:35:51,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:35:51,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:51,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:51,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764032988] [2025-04-30 10:35:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764032988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:51,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:51,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:51,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336853086] [2025-04-30 10:35:51,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:51,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:51,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:51,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:51,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:51,129 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 73 [2025-04-30 10:35:51,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-04-30 10:35:51,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:51,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 73 [2025-04-30 10:35:51,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:51,200 INFO L116 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-04-30 10:35:51,201 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-30 10:35:51,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 269 events. 65/269 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1296 event pairs, 63 based on Foata normal form. 2/214 useless extension candidates. Maximal degree in co-relation 421. Up to 163 conditions per place. [2025-04-30 10:35:51,203 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 34 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-04-30 10:35:51,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 74 transitions, 320 flow [2025-04-30 10:35:51,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-04-30 10:35:51,204 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7077625570776256 [2025-04-30 10:35:51,204 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 252 flow. Second operand 3 states and 155 transitions. [2025-04-30 10:35:51,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 74 transitions, 320 flow [2025-04-30 10:35:51,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 74 transitions, 272 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-30 10:35:51,223 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 204 flow [2025-04-30 10:35:51,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2025-04-30 10:35:51,223 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 14 predicate places. [2025-04-30 10:35:51,223 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 204 flow [2025-04-30 10:35:51,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-04-30 10:35:51,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:51,224 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:51,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:35:51,224 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:51,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1883165448, now seen corresponding path program 1 times [2025-04-30 10:35:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:51,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123246792] [2025-04-30 10:35:51,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:35:51,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:35:51,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:51,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:51,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123246792] [2025-04-30 10:35:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123246792] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:51,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440136125] [2025-04-30 10:35:51,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:51,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:51,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:51,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:51,568 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-04-30 10:35:51,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-04-30 10:35:51,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:51,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-04-30 10:35:51,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:51,648 INFO L116 PetriNetUnfolderBase]: 74/291 cut-off events. [2025-04-30 10:35:51,649 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-30 10:35:51,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 291 events. 74/291 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1410 event pairs, 72 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 474. Up to 185 conditions per place. [2025-04-30 10:35:51,652 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 40 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-04-30 10:35:51,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 70 transitions, 278 flow [2025-04-30 10:35:51,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-04-30 10:35:51,653 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.680365296803653 [2025-04-30 10:35:51,653 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 204 flow. Second operand 3 states and 149 transitions. [2025-04-30 10:35:51,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 70 transitions, 278 flow [2025-04-30 10:35:51,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:51,656 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 190 flow [2025-04-30 10:35:51,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2025-04-30 10:35:51,658 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2025-04-30 10:35:51,658 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 190 flow [2025-04-30 10:35:51,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-04-30 10:35:51,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:51,658 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:51,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:35:51,658 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:51,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1883165447, now seen corresponding path program 1 times [2025-04-30 10:35:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:51,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161196769] [2025-04-30 10:35:51,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:51,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:51,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:35:51,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:35:51,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:51,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:51,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:51,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161196769] [2025-04-30 10:35:51,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161196769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:51,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:51,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:51,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706853641] [2025-04-30 10:35:51,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:51,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:51,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:51,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:52,101 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2025-04-30 10:35:52,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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-04-30 10:35:52,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:52,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2025-04-30 10:35:52,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:52,205 INFO L116 PetriNetUnfolderBase]: 65/277 cut-off events. [2025-04-30 10:35:52,205 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-30 10:35:52,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 277 events. 65/277 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1243 event pairs, 63 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 472. Up to 166 conditions per place. [2025-04-30 10:35:52,206 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 40 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2025-04-30 10:35:52,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 298 flow [2025-04-30 10:35:52,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2025-04-30 10:35:52,207 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.589041095890411 [2025-04-30 10:35:52,207 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 190 flow. Second operand 5 states and 215 transitions. [2025-04-30 10:35:52,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 298 flow [2025-04-30 10:35:52,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:52,209 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 239 flow [2025-04-30 10:35:52,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2025-04-30 10:35:52,210 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-04-30 10:35:52,210 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 239 flow [2025-04-30 10:35:52,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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-04-30 10:35:52,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:52,210 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:52,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:35:52,210 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:52,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1107072143, now seen corresponding path program 1 times [2025-04-30 10:35:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:52,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865898554] [2025-04-30 10:35:52,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:52,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:35:52,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:35:52,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:52,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:52,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:52,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865898554] [2025-04-30 10:35:52,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865898554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:52,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:52,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519752075] [2025-04-30 10:35:52,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:52,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:52,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:52,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:52,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:52,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-04-30 10:35:52,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 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-04-30 10:35:52,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:52,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-04-30 10:35:52,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:52,748 INFO L116 PetriNetUnfolderBase]: 65/273 cut-off events. [2025-04-30 10:35:52,749 INFO L117 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-04-30 10:35:52,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 273 events. 65/273 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1214 event pairs, 63 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 491. Up to 160 conditions per place. [2025-04-30 10:35:52,750 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 35 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2025-04-30 10:35:52,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 73 transitions, 327 flow [2025-04-30 10:35:52,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 285 transitions. [2025-04-30 10:35:52,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5577299412915852 [2025-04-30 10:35:52,751 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 239 flow. Second operand 7 states and 285 transitions. [2025-04-30 10:35:52,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 73 transitions, 327 flow [2025-04-30 10:35:52,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:52,753 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 253 flow [2025-04-30 10:35:52,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2025-04-30 10:35:52,753 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2025-04-30 10:35:52,754 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 253 flow [2025-04-30 10:35:52,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 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-04-30 10:35:52,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:52,754 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:52,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:35:52,754 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:52,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1107072144, now seen corresponding path program 1 times [2025-04-30 10:35:52,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:52,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168857790] [2025-04-30 10:35:52,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:52,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:52,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:35:52,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:35:52,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:52,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:53,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:53,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168857790] [2025-04-30 10:35:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168857790] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:53,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:53,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:35:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773370610] [2025-04-30 10:35:53,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:53,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:53,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:53,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:53,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 73 [2025-04-30 10:35:53,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 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-04-30 10:35:53,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:53,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 73 [2025-04-30 10:35:53,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:53,412 INFO L116 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-04-30 10:35:53,413 INFO L117 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-04-30 10:35:53,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 269 events. 65/269 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1188 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 492. Up to 160 conditions per place. [2025-04-30 10:35:53,414 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 32 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2025-04-30 10:35:53,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 71 transitions, 335 flow [2025-04-30 10:35:53,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 303 transitions. [2025-04-30 10:35:53,415 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5929549902152642 [2025-04-30 10:35:53,415 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 253 flow. Second operand 7 states and 303 transitions. [2025-04-30 10:35:53,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 71 transitions, 335 flow [2025-04-30 10:35:53,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 71 transitions, 313 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:53,417 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 249 flow [2025-04-30 10:35:53,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2025-04-30 10:35:53,417 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-04-30 10:35:53,417 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 249 flow [2025-04-30 10:35:53,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 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-04-30 10:35:53,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:53,417 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:53,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:35:53,418 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:53,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:53,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1255541365, now seen corresponding path program 1 times [2025-04-30 10:35:53,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:53,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290816613] [2025-04-30 10:35:53,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:53,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:35:53,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:35:53,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:53,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:53,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290816613] [2025-04-30 10:35:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290816613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:53,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464281811] [2025-04-30 10:35:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:53,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:53,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:53,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:53,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:53,707 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 73 [2025-04-30 10:35:53,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 71 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-04-30 10:35:53,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:53,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 73 [2025-04-30 10:35:53,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:53,798 INFO L116 PetriNetUnfolderBase]: 65/267 cut-off events. [2025-04-30 10:35:53,798 INFO L117 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-04-30 10:35:53,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 267 events. 65/267 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1175 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 490. Up to 162 conditions per place. [2025-04-30 10:35:53,799 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 32 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2025-04-30 10:35:53,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 70 transitions, 333 flow [2025-04-30 10:35:53,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2025-04-30 10:35:53,801 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6821917808219178 [2025-04-30 10:35:53,801 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 249 flow. Second operand 5 states and 249 transitions. [2025-04-30 10:35:53,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 70 transitions, 333 flow [2025-04-30 10:35:53,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 311 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:53,803 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 247 flow [2025-04-30 10:35:53,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2025-04-30 10:35:53,803 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2025-04-30 10:35:53,803 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 247 flow [2025-04-30 10:35:53,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-04-30 10:35:53,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:53,804 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:53,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:35:53,804 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:53,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1255541366, now seen corresponding path program 1 times [2025-04-30 10:35:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:53,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351116059] [2025-04-30 10:35:53,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:53,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:53,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:35:53,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:35:53,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:53,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:53,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351116059] [2025-04-30 10:35:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351116059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:53,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:53,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:53,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811617709] [2025-04-30 10:35:53,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:53,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:53,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:53,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:53,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-04-30 10:35:53,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 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-04-30 10:35:53,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:53,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-04-30 10:35:53,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:54,080 INFO L116 PetriNetUnfolderBase]: 65/265 cut-off events. [2025-04-30 10:35:54,080 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-30 10:35:54,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 265 events. 65/265 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1171 event pairs, 63 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 492. Up to 162 conditions per place. [2025-04-30 10:35:54,081 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 34 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2025-04-30 10:35:54,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 69 transitions, 335 flow [2025-04-30 10:35:54,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2025-04-30 10:35:54,083 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6054794520547945 [2025-04-30 10:35:54,083 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 247 flow. Second operand 5 states and 221 transitions. [2025-04-30 10:35:54,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 69 transitions, 335 flow [2025-04-30 10:35:54,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 69 transitions, 313 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:54,084 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 245 flow [2025-04-30 10:35:54,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2025-04-30 10:35:54,085 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 11 predicate places. [2025-04-30 10:35:54,085 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 245 flow [2025-04-30 10:35:54,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 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-04-30 10:35:54,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:54,086 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:54,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:35:54,086 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:54,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2109231287, now seen corresponding path program 1 times [2025-04-30 10:35:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:54,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548610210] [2025-04-30 10:35:54,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:54,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:54,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:35:54,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:35:54,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:54,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:54,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548610210] [2025-04-30 10:35:54,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548610210] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:54,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282963118] [2025-04-30 10:35:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:54,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:54,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:54,391 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-04-30 10:35:54,393 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-04-30 10:35:54,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:35:54,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:35:54,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:54,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:54,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-30 10:35:54,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:54,666 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:35:54,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:35:54,674 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:35:54,740 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:35:54,741 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:35:54,746 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:35:54,749 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:35:54,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:54,866 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:35:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:54,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:55,084 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:35:55,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-30 10:35:55,147 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:35:55,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-30 10:35:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:55,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282963118] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:55,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:55,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 20 [2025-04-30 10:35:55,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711931138] [2025-04-30 10:35:55,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:55,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:35:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:55,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:35:55,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:35:57,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-04-30 10:35:57,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 245 flow. Second operand has 22 states, 22 states have (on average 35.77272727272727) internal successors, (787), 22 states have internal predecessors, (787), 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-04-30 10:35:57,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:57,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-04-30 10:35:57,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:57,713 INFO L116 PetriNetUnfolderBase]: 75/305 cut-off events. [2025-04-30 10:35:57,713 INFO L117 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-04-30 10:35:57,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 305 events. 75/305 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1357 event pairs, 72 based on Foata normal form. 5/262 useless extension candidates. Maximal degree in co-relation 568. Up to 176 conditions per place. [2025-04-30 10:35:57,715 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 43 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2025-04-30 10:35:57,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 78 transitions, 399 flow [2025-04-30 10:35:57,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:35:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:35:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 424 transitions. [2025-04-30 10:35:57,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5280199252801993 [2025-04-30 10:35:57,716 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 245 flow. Second operand 11 states and 424 transitions. [2025-04-30 10:35:57,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 78 transitions, 399 flow [2025-04-30 10:35:57,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 78 transitions, 361 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:57,718 INFO L231 Difference]: Finished difference. Result has 90 places, 70 transitions, 256 flow [2025-04-30 10:35:57,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=256, PETRI_PLACES=90, PETRI_TRANSITIONS=70} [2025-04-30 10:35:57,719 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2025-04-30 10:35:57,719 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 256 flow [2025-04-30 10:35:57,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 35.77272727272727) internal successors, (787), 22 states have internal predecessors, (787), 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-04-30 10:35:57,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:57,720 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:57,727 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-04-30 10:35:57,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:57,924 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:57,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:57,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1778671064, now seen corresponding path program 1 times [2025-04-30 10:35:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:57,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349678122] [2025-04-30 10:35:57,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:57,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:35:57,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:35:57,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:57,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:58,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349678122] [2025-04-30 10:35:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349678122] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:58,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953782556] [2025-04-30 10:35:58,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:58,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:58,035 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-04-30 10:35:58,037 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-04-30 10:35:58,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:35:58,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:35:58,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:58,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:58,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:35:58,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:58,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:58,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953782556] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:58,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:58,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:35:58,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353866294] [2025-04-30 10:35:58,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:58,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:35:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:58,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:35:58,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:35:58,267 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-04-30 10:35:58,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 256 flow. Second operand has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-04-30 10:35:58,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:58,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-04-30 10:35:58,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:58,399 INFO L116 PetriNetUnfolderBase]: 65/304 cut-off events. [2025-04-30 10:35:58,399 INFO L117 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-04-30 10:35:58,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 304 events. 65/304 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1105 event pairs, 63 based on Foata normal form. 1/260 useless extension candidates. Maximal degree in co-relation 586. Up to 158 conditions per place. [2025-04-30 10:35:58,401 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 66 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2025-04-30 10:35:58,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 98 transitions, 514 flow [2025-04-30 10:35:58,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:35:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:35:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 428 transitions. [2025-04-30 10:35:58,402 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7328767123287672 [2025-04-30 10:35:58,402 INFO L175 Difference]: Start difference. First operand has 90 places, 70 transitions, 256 flow. Second operand 8 states and 428 transitions. [2025-04-30 10:35:58,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 98 transitions, 514 flow [2025-04-30 10:35:58,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 98 transitions, 490 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:58,404 INFO L231 Difference]: Finished difference. Result has 97 places, 73 transitions, 292 flow [2025-04-30 10:35:58,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=292, PETRI_PLACES=97, PETRI_TRANSITIONS=73} [2025-04-30 10:35:58,405 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 23 predicate places. [2025-04-30 10:35:58,405 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 73 transitions, 292 flow [2025-04-30 10:35:58,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-04-30 10:35:58,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:58,405 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:58,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:35:58,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:58,606 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:58,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash -629807584, now seen corresponding path program 2 times [2025-04-30 10:35:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:58,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726035377] [2025-04-30 10:35:58,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:58,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-04-30 10:35:58,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-04-30 10:35:58,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:35:58,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:58,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:58,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726035377] [2025-04-30 10:35:58,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726035377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:58,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164194521] [2025-04-30 10:35:58,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:58,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:58,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:58,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:58,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:35:59,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-04-30 10:35:59,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-04-30 10:35:59,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:35:59,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:59,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:35:59,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:59,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:59,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164194521] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:59,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:59,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-04-30 10:35:59,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644945910] [2025-04-30 10:35:59,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:59,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:35:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:59,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:35:59,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:35:59,338 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-04-30 10:35:59,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 73 transitions, 292 flow. Second operand has 13 states, 13 states have (on average 51.15384615384615) internal successors, (665), 13 states have internal predecessors, (665), 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-04-30 10:35:59,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:59,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-04-30 10:35:59,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:59,545 INFO L116 PetriNetUnfolderBase]: 65/344 cut-off events. [2025-04-30 10:35:59,545 INFO L117 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-04-30 10:35:59,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 344 events. 65/344 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1104 event pairs, 63 based on Foata normal form. 4/304 useless extension candidates. Maximal degree in co-relation 706. Up to 158 conditions per place. [2025-04-30 10:35:59,549 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 90 selfloop transitions, 12 changer transitions 0/126 dead transitions. [2025-04-30 10:35:59,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 126 transitions, 728 flow [2025-04-30 10:35:59,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:35:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:35:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 636 transitions. [2025-04-30 10:35:59,550 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.726027397260274 [2025-04-30 10:35:59,550 INFO L175 Difference]: Start difference. First operand has 97 places, 73 transitions, 292 flow. Second operand 12 states and 636 transitions. [2025-04-30 10:35:59,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 126 transitions, 728 flow [2025-04-30 10:35:59,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 126 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:59,553 INFO L231 Difference]: Finished difference. Result has 111 places, 78 transitions, 387 flow [2025-04-30 10:35:59,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=387, PETRI_PLACES=111, PETRI_TRANSITIONS=78} [2025-04-30 10:35:59,555 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 37 predicate places. [2025-04-30 10:35:59,555 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 78 transitions, 387 flow [2025-04-30 10:35:59,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.15384615384615) internal successors, (665), 13 states have internal predecessors, (665), 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-04-30 10:35:59,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:59,556 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:59,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:35:59,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-30 10:35:59,758 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:59,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1017458152, now seen corresponding path program 3 times [2025-04-30 10:35:59,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:59,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621545092] [2025-04-30 10:35:59,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:35:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:59,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 11 equivalence classes. [2025-04-30 10:35:59,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 118 statements. [2025-04-30 10:35:59,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:35:59,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 10 proven. 37 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2025-04-30 10:35:59,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:59,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621545092] [2025-04-30 10:35:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621545092] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:59,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700202487] [2025-04-30 10:35:59,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:35:59,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:59,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:59,904 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:59,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:36:00,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 11 equivalence classes. [2025-04-30 10:36:00,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 118 statements. [2025-04-30 10:36:00,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:36:00,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:00,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:36:00,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:36:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2025-04-30 10:36:00,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:36:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700202487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:00,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:36:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-04-30 10:36:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161451192] [2025-04-30 10:36:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:00,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:36:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:00,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:36:00,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:36:00,661 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 73 [2025-04-30 10:36:00,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 78 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 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-04-30 10:36:00,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:00,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 73 [2025-04-30 10:36:00,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:00,791 INFO L116 PetriNetUnfolderBase]: 71/384 cut-off events. [2025-04-30 10:36:00,791 INFO L117 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2025-04-30 10:36:00,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 384 events. 71/384 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1469 event pairs, 18 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 783. Up to 126 conditions per place. [2025-04-30 10:36:00,793 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 46 selfloop transitions, 22 changer transitions 3/94 dead transitions. [2025-04-30 10:36:00,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 94 transitions, 561 flow [2025-04-30 10:36:00,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:36:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:36:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 355 transitions. [2025-04-30 10:36:00,795 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6947162426614482 [2025-04-30 10:36:00,795 INFO L175 Difference]: Start difference. First operand has 111 places, 78 transitions, 387 flow. Second operand 7 states and 355 transitions. [2025-04-30 10:36:00,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 94 transitions, 561 flow [2025-04-30 10:36:00,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 94 transitions, 551 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:36:00,798 INFO L231 Difference]: Finished difference. Result has 113 places, 80 transitions, 432 flow [2025-04-30 10:36:00,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=113, PETRI_TRANSITIONS=80} [2025-04-30 10:36:00,798 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 39 predicate places. [2025-04-30 10:36:00,799 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 80 transitions, 432 flow [2025-04-30 10:36:00,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 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-04-30 10:36:00,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:00,799 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:00,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:36:00,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:36:01,000 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:36:01,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:01,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1016278347, now seen corresponding path program 1 times [2025-04-30 10:36:01,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:01,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412061891] [2025-04-30 10:36:01,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:01,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-30 10:36:01,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-30 10:36:01,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:01,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-04-30 10:36:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:01,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412061891] [2025-04-30 10:36:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412061891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:01,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:36:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:36:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871725514] [2025-04-30 10:36:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:01,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:36:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:01,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:36:01,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:36:01,297 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 73 [2025-04-30 10:36:01,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 80 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-04-30 10:36:01,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:01,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 73 [2025-04-30 10:36:01,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:01,398 INFO L116 PetriNetUnfolderBase]: 72/359 cut-off events. [2025-04-30 10:36:01,399 INFO L117 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2025-04-30 10:36:01,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 359 events. 72/359 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1178 event pairs, 51 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 817. Up to 214 conditions per place. [2025-04-30 10:36:01,400 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 61 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-04-30 10:36:01,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 85 transitions, 572 flow [2025-04-30 10:36:01,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:36:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:36:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2025-04-30 10:36:01,402 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7488584474885844 [2025-04-30 10:36:01,402 INFO L175 Difference]: Start difference. First operand has 113 places, 80 transitions, 432 flow. Second operand 3 states and 164 transitions. [2025-04-30 10:36:01,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 85 transitions, 572 flow [2025-04-30 10:36:01,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 85 transitions, 535 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-30 10:36:01,406 INFO L231 Difference]: Finished difference. Result has 109 places, 78 transitions, 398 flow [2025-04-30 10:36:01,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=109, PETRI_TRANSITIONS=78} [2025-04-30 10:36:01,407 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 35 predicate places. [2025-04-30 10:36:01,408 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 78 transitions, 398 flow [2025-04-30 10:36:01,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-04-30 10:36:01,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:01,408 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:01,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:36:01,409 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:36:01,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1016278346, now seen corresponding path program 1 times [2025-04-30 10:36:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:01,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313030849] [2025-04-30 10:36:01,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:01,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:01,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-30 10:36:01,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-30 10:36:01,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:01,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-04-30 10:36:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:01,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313030849] [2025-04-30 10:36:01,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313030849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:01,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:36:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:36:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233653337] [2025-04-30 10:36:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:01,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:36:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:01,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:36:01,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:36:01,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 73 [2025-04-30 10:36:01,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 78 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-04-30 10:36:01,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:01,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 73 [2025-04-30 10:36:01,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:01,943 INFO L116 PetriNetUnfolderBase]: 65/337 cut-off events. [2025-04-30 10:36:01,944 INFO L117 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2025-04-30 10:36:01,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 337 events. 65/337 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1028 event pairs, 50 based on Foata normal form. 16/320 useless extension candidates. Maximal degree in co-relation 762. Up to 214 conditions per place. [2025-04-30 10:36:01,945 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 60 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2025-04-30 10:36:01,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 83 transitions, 535 flow [2025-04-30 10:36:01,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:36:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:36:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-04-30 10:36:01,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7579908675799086 [2025-04-30 10:36:01,947 INFO L175 Difference]: Start difference. First operand has 109 places, 78 transitions, 398 flow. Second operand 3 states and 166 transitions. [2025-04-30 10:36:01,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 83 transitions, 535 flow [2025-04-30 10:36:01,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 83 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:36:01,950 INFO L231 Difference]: Finished difference. Result has 107 places, 76 transitions, 394 flow [2025-04-30 10:36:01,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=107, PETRI_TRANSITIONS=76} [2025-04-30 10:36:01,951 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 33 predicate places. [2025-04-30 10:36:01,951 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 76 transitions, 394 flow [2025-04-30 10:36:01,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-04-30 10:36:01,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:01,951 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:01,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:36:01,951 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:36:01,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1476431225, now seen corresponding path program 1 times [2025-04-30 10:36:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:01,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288546364] [2025-04-30 10:36:01,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:02,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-30 10:36:03,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-30 10:36:03,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:03,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15