./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue_ok.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:33:41,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:33:41,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:33:41,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:33:41,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:33:42,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:33:42,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:33:42,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:33:42,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:33:42,014 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:33:42,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:33:42,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:33:42,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:33:42,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:33:42,015 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:33:42,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:33:42,015 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:33:42,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:33:42,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:33:42,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:33:42,016 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:33:42,016 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:33:42,016 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:33:42,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:33:42,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:33:42,016 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:33:42,017 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:33:42,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:33:42,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:33:42,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:33:42,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:33:42,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:33:42,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:33:42,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:33:42,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:33:42,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:33:42,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:33:42,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:33:42,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:33:42,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:33:42,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:33:42,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:33:42,018 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-02-06 12:33:42,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:33:42,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:33:42,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:33:42,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:33:42,271 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:33:42,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-02-06 12:33:43,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dba83d72/bce3aeca9a9b4a28863f828fa7a8e8bf/FLAG45f3bbee6 [2025-02-06 12:33:43,960 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:33:43,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-02-06 12:33:43,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dba83d72/bce3aeca9a9b4a28863f828fa7a8e8bf/FLAG45f3bbee6 [2025-02-06 12:33:44,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dba83d72/bce3aeca9a9b4a28863f828fa7a8e8bf [2025-02-06 12:33:44,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:33:44,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:33:44,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:33:44,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:33:44,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:33:44,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390b6cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44, skipping insertion in model container [2025-02-06 12:33:44,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:33:44,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:33:44,529 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:33:44,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:33:44,640 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:33:44,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44 WrapperNode [2025-02-06 12:33:44,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:33:44,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:33:44,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:33:44,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:33:44,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,699 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 235 [2025-02-06 12:33:44,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:33:44,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:33:44,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:33:44,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:33:44,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,729 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 46, 5, 22]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 23, 5, 20]. The 11 writes are split as follows [0, 10, 0, 1]. [2025-02-06 12:33:44,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:33:44,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:33:44,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:33:44,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:33:44,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (1/1) ... [2025-02-06 12:33:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:33:44,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:33:44,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:33:44,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:33:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 12:33:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 12:33:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 12:33:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 12:33:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:33:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:33:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:33:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:33:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:33:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:33:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:33:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:33:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:33:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:33:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:33:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:33:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:33:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:33:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:33:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:33:44,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:33:44,806 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:33:44,927 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:33:44,929 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:33:45,292 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:33:45,292 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:33:45,501 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:33:45,501 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:33:45,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:33:45 BoogieIcfgContainer [2025-02-06 12:33:45,502 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:33:45,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:33:45,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:33:45,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:33:45,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:33:44" (1/3) ... [2025-02-06 12:33:45,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35217172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:33:45, skipping insertion in model container [2025-02-06 12:33:45,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:44" (2/3) ... [2025-02-06 12:33:45,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35217172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:33:45, skipping insertion in model container [2025-02-06 12:33:45,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:33:45" (3/3) ... [2025-02-06 12:33:45,508 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-02-06 12:33:45,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:33:45,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 119 locations, 1 initial locations, 2 loop locations, and 53 error locations. [2025-02-06 12:33:45,520 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:33:45,598 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:33:45,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 272 flow [2025-02-06 12:33:45,681 INFO L124 PetriNetUnfolderBase]: 11/127 cut-off events. [2025-02-06 12:33:45,683 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:33:45,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 127 events. 11/127 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 397 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2025-02-06 12:33:45,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 129 transitions, 272 flow [2025-02-06 12:33:45,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2025-02-06 12:33:45,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:33:45,710 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b98ffe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:33:45,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-02-06 12:33:45,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:33:45,716 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-06 12:33:45,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:33:45,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:45,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:33:45,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:45,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 21643, now seen corresponding path program 1 times [2025-02-06 12:33:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:45,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153515285] [2025-02-06 12:33:45,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:45,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:33:45,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:33:45,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:45,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:45,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153515285] [2025-02-06 12:33:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153515285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:45,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517663634] [2025-02-06 12:33:45,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:45,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:45,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:45,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:45,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:46,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2025-02-06 12:33:46,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:46,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:46,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2025-02-06 12:33:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:46,506 INFO L124 PetriNetUnfolderBase]: 1087/2983 cut-off events. [2025-02-06 12:33:46,506 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-02-06 12:33:46,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2983 events. 1087/2983 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23587 event pairs, 837 based on Foata normal form. 68/2108 useless extension candidates. Maximal degree in co-relation 4566. Up to 1686 conditions per place. [2025-02-06 12:33:46,529 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-02-06 12:33:46,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 334 flow [2025-02-06 12:33:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-02-06 12:33:46,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6873385012919897 [2025-02-06 12:33:46,542 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states and 266 transitions. [2025-02-06 12:33:46,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 334 flow [2025-02-06 12:33:46,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:46,550 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2025-02-06 12:33:46,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2025-02-06 12:33:46,555 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2025-02-06 12:33:46,556 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2025-02-06 12:33:46,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:46,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:46,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:33:46,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:33:46,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:46,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash 21644, now seen corresponding path program 1 times [2025-02-06 12:33:46,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683606675] [2025-02-06 12:33:46,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:46,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:33:46,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:33:46,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:46,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:46,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:46,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683606675] [2025-02-06 12:33:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683606675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456988751] [2025-02-06 12:33:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:46,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:46,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:46,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:46,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2025-02-06 12:33:46,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:46,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:46,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2025-02-06 12:33:46,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:47,392 INFO L124 PetriNetUnfolderBase]: 1087/2980 cut-off events. [2025-02-06 12:33:47,392 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 12:33:47,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4686 conditions, 2980 events. 1087/2980 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23577 event pairs, 837 based on Foata normal form. 3/2042 useless extension candidates. Maximal degree in co-relation 4675. Up to 1686 conditions per place. [2025-02-06 12:33:47,410 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-02-06 12:33:47,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 324 flow [2025-02-06 12:33:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-02-06 12:33:47,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6795865633074936 [2025-02-06 12:33:47,414 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 263 transitions. [2025-02-06 12:33:47,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 324 flow [2025-02-06 12:33:47,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:47,417 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 230 flow [2025-02-06 12:33:47,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2025-02-06 12:33:47,418 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2025-02-06 12:33:47,419 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 230 flow [2025-02-06 12:33:47,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:47,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:47,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:33:47,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:33:47,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:47,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash 645326531, now seen corresponding path program 1 times [2025-02-06 12:33:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:47,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322019341] [2025-02-06 12:33:47,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:47,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:33:47,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:33:47,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:47,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:47,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:47,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322019341] [2025-02-06 12:33:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322019341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:47,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:47,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862621543] [2025-02-06 12:33:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:47,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:33:47,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:47,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:33:47,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:33:47,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-02-06 12:33:47,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:47,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:47,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-02-06 12:33:47,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:47,861 INFO L124 PetriNetUnfolderBase]: 1087/2978 cut-off events. [2025-02-06 12:33:47,861 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 12:33:47,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 2978 events. 1087/2978 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23611 event pairs, 837 based on Foata normal form. 1/2040 useless extension candidates. Maximal degree in co-relation 4673. Up to 1685 conditions per place. [2025-02-06 12:33:47,873 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-02-06 12:33:47,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 320 flow [2025-02-06 12:33:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2025-02-06 12:33:47,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2025-02-06 12:33:47,877 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 230 flow. Second operand 4 states and 337 transitions. [2025-02-06 12:33:47,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 320 flow [2025-02-06 12:33:47,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:47,878 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 228 flow [2025-02-06 12:33:47,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2025-02-06 12:33:47,879 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2025-02-06 12:33:47,879 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 228 flow [2025-02-06 12:33:47,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:47,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:47,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:33:47,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:33:47,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:47,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:47,880 INFO L85 PathProgramCache]: Analyzing trace with hash 645326532, now seen corresponding path program 1 times [2025-02-06 12:33:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:47,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192781159] [2025-02-06 12:33:47,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:47,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:47,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:33:47,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:33:47,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:47,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:48,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192781159] [2025-02-06 12:33:48,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192781159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:48,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:48,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:48,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004164544] [2025-02-06 12:33:48,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:48,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:33:48,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:48,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:33:48,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:33:48,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-02-06 12:33:48,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:48,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:48,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-02-06 12:33:48,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:48,370 INFO L124 PetriNetUnfolderBase]: 1087/2976 cut-off events. [2025-02-06 12:33:48,370 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:33:48,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4683 conditions, 2976 events. 1087/2976 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23576 event pairs, 837 based on Foata normal form. 2/2040 useless extension candidates. Maximal degree in co-relation 4668. Up to 1685 conditions per place. [2025-02-06 12:33:48,381 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-02-06 12:33:48,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 318 flow [2025-02-06 12:33:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2025-02-06 12:33:48,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2025-02-06 12:33:48,383 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 228 flow. Second operand 4 states and 337 transitions. [2025-02-06 12:33:48,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 318 flow [2025-02-06 12:33:48,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 312 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:33:48,385 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 224 flow [2025-02-06 12:33:48,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2025-02-06 12:33:48,386 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2025-02-06 12:33:48,386 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 224 flow [2025-02-06 12:33:48,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:48,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:48,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:48,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:33:48,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:48,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1133545387, now seen corresponding path program 1 times [2025-02-06 12:33:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:48,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978236919] [2025-02-06 12:33:48,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:48,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:33:48,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:33:48,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:48,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:48,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978236919] [2025-02-06 12:33:48,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978236919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:48,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077901896] [2025-02-06 12:33:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:48,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:33:48,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:48,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:33:48,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:33:48,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 129 [2025-02-06 12:33:48,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:48,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:48,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 129 [2025-02-06 12:33:48,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:48,885 INFO L124 PetriNetUnfolderBase]: 1044/2659 cut-off events. [2025-02-06 12:33:48,885 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:33:48,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4321 conditions, 2659 events. 1044/2659 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 20000 event pairs, 424 based on Foata normal form. 120/2115 useless extension candidates. Maximal degree in co-relation 4306. Up to 879 conditions per place. [2025-02-06 12:33:48,893 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2025-02-06 12:33:48,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 123 transitions, 397 flow [2025-02-06 12:33:48,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2025-02-06 12:33:48,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2025-02-06 12:33:48,896 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 224 flow. Second operand 4 states and 345 transitions. [2025-02-06 12:33:48,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 123 transitions, 397 flow [2025-02-06 12:33:48,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 123 transitions, 391 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:33:48,898 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 210 flow [2025-02-06 12:33:48,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2025-02-06 12:33:48,899 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2025-02-06 12:33:48,899 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 210 flow [2025-02-06 12:33:48,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:48,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:48,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:48,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:33:48,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:48,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1133545386, now seen corresponding path program 1 times [2025-02-06 12:33:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:48,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730571438] [2025-02-06 12:33:48,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:48,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:33:48,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:33:48,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:48,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:49,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:49,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730571438] [2025-02-06 12:33:49,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730571438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:49,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:49,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646784102] [2025-02-06 12:33:49,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:49,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:33:49,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:49,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:33:49,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:33:49,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 129 [2025-02-06 12:33:49,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:49,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:49,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 129 [2025-02-06 12:33:49,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:49,321 INFO L124 PetriNetUnfolderBase]: 1044/2353 cut-off events. [2025-02-06 12:33:49,322 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-02-06 12:33:49,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4093 conditions, 2353 events. 1044/2353 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 15869 event pairs, 424 based on Foata normal form. 120/1999 useless extension candidates. Maximal degree in co-relation 1949. Up to 879 conditions per place. [2025-02-06 12:33:49,330 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2025-02-06 12:33:49,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 381 flow [2025-02-06 12:33:49,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2025-02-06 12:33:49,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2025-02-06 12:33:49,335 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 210 flow. Second operand 4 states and 342 transitions. [2025-02-06 12:33:49,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 381 flow [2025-02-06 12:33:49,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 115 transitions, 375 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:33:49,336 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 194 flow [2025-02-06 12:33:49,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2025-02-06 12:33:49,337 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -31 predicate places. [2025-02-06 12:33:49,337 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 194 flow [2025-02-06 12:33:49,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:49,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:49,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:49,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:33:49,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:49,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash 780169241, now seen corresponding path program 1 times [2025-02-06 12:33:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296415908] [2025-02-06 12:33:49,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:49,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:33:49,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:33:49,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:49,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:49,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:49,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296415908] [2025-02-06 12:33:49,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296415908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:49,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:49,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:33:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991992337] [2025-02-06 12:33:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:49,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:33:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:49,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:33:49,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:33:50,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 129 [2025-02-06 12:33:50,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:50,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:50,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 129 [2025-02-06 12:33:50,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:50,639 INFO L124 PetriNetUnfolderBase]: 2063/4250 cut-off events. [2025-02-06 12:33:50,639 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-06 12:33:50,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7671 conditions, 4250 events. 2063/4250 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29527 event pairs, 287 based on Foata normal form. 0/3446 useless extension candidates. Maximal degree in co-relation 2867. Up to 2157 conditions per place. [2025-02-06 12:33:50,652 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 132 selfloop transitions, 11 changer transitions 0/182 dead transitions. [2025-02-06 12:33:50,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 182 transitions, 667 flow [2025-02-06 12:33:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:33:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:33:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 551 transitions. [2025-02-06 12:33:50,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101882613510521 [2025-02-06 12:33:50,657 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 194 flow. Second operand 7 states and 551 transitions. [2025-02-06 12:33:50,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 182 transitions, 667 flow [2025-02-06 12:33:50,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 182 transitions, 659 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:33:50,662 INFO L231 Difference]: Finished difference. Result has 98 places, 102 transitions, 262 flow [2025-02-06 12:33:50,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=102} [2025-02-06 12:33:50,664 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2025-02-06 12:33:50,664 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 262 flow [2025-02-06 12:33:50,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:50,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:50,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:50,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:33:50,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:50,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash -807283610, now seen corresponding path program 1 times [2025-02-06 12:33:50,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:50,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334564658] [2025-02-06 12:33:50,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:50,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:33:50,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:33:50,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:50,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334564658] [2025-02-06 12:33:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334564658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:50,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448894489] [2025-02-06 12:33:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:33:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:50,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:33:50,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:33:50,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-02-06 12:33:50,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:50,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:50,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-02-06 12:33:50,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:51,206 INFO L124 PetriNetUnfolderBase]: 1788/4083 cut-off events. [2025-02-06 12:33:51,206 INFO L125 PetriNetUnfolderBase]: For 288/288 co-relation queries the response was YES. [2025-02-06 12:33:51,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7510 conditions, 4083 events. 1788/4083 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 30767 event pairs, 1242 based on Foata normal form. 64/3283 useless extension candidates. Maximal degree in co-relation 7125. Up to 2610 conditions per place. [2025-02-06 12:33:51,226 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 74 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-02-06 12:33:51,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 477 flow [2025-02-06 12:33:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2025-02-06 12:33:51,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.687984496124031 [2025-02-06 12:33:51,229 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 262 flow. Second operand 4 states and 355 transitions. [2025-02-06 12:33:51,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 477 flow [2025-02-06 12:33:51,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:51,233 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 262 flow [2025-02-06 12:33:51,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2025-02-06 12:33:51,234 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2025-02-06 12:33:51,234 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 262 flow [2025-02-06 12:33:51,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:51,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:51,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:33:51,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:51,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:51,235 INFO L85 PathProgramCache]: Analyzing trace with hash -807283609, now seen corresponding path program 1 times [2025-02-06 12:33:51,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814652091] [2025-02-06 12:33:51,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:51,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:51,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:33:51,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:33:51,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:51,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:51,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814652091] [2025-02-06 12:33:51,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814652091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:51,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:51,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:51,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899919315] [2025-02-06 12:33:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:51,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:51,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:51,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:51,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:51,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2025-02-06 12:33:51,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:51,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2025-02-06 12:33:51,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:51,572 INFO L124 PetriNetUnfolderBase]: 692/1626 cut-off events. [2025-02-06 12:33:51,572 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-02-06 12:33:51,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 1626 events. 692/1626 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9853 event pairs, 446 based on Foata normal form. 45/1450 useless extension candidates. Maximal degree in co-relation 3073. Up to 693 conditions per place. [2025-02-06 12:33:51,579 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 59 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-02-06 12:33:51,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 107 transitions, 391 flow [2025-02-06 12:33:51,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-02-06 12:33:51,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7260981912144703 [2025-02-06 12:33:51,581 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 262 flow. Second operand 3 states and 281 transitions. [2025-02-06 12:33:51,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 107 transitions, 391 flow [2025-02-06 12:33:51,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 107 transitions, 383 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:51,584 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 245 flow [2025-02-06 12:33:51,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2025-02-06 12:33:51,585 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -26 predicate places. [2025-02-06 12:33:51,585 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 245 flow [2025-02-06 12:33:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:51,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:51,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:33:51,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:51,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1023274309, now seen corresponding path program 1 times [2025-02-06 12:33:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546521737] [2025-02-06 12:33:51,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:51,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:33:51,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:33:51,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:51,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:51,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:51,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546521737] [2025-02-06 12:33:51,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546521737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:51,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:51,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:51,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848583188] [2025-02-06 12:33:51,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:51,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:51,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:51,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:51,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2025-02-06 12:33:51,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:51,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2025-02-06 12:33:51,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:51,855 INFO L124 PetriNetUnfolderBase]: 572/1370 cut-off events. [2025-02-06 12:33:51,855 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 12:33:51,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1370 events. 572/1370 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7412 event pairs, 380 based on Foata normal form. 12/1196 useless extension candidates. Maximal degree in co-relation 1700. Up to 753 conditions per place. [2025-02-06 12:33:51,861 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 62 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-02-06 12:33:51,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 109 transitions, 397 flow [2025-02-06 12:33:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-02-06 12:33:51,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7416020671834626 [2025-02-06 12:33:51,863 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 245 flow. Second operand 3 states and 287 transitions. [2025-02-06 12:33:51,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 109 transitions, 397 flow [2025-02-06 12:33:51,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 389 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:51,866 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 244 flow [2025-02-06 12:33:51,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2025-02-06 12:33:51,867 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -25 predicate places. [2025-02-06 12:33:51,867 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 244 flow [2025-02-06 12:33:51,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:51,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:51,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:33:51,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:51,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:51,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1554101556, now seen corresponding path program 1 times [2025-02-06 12:33:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:51,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231484814] [2025-02-06 12:33:51,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:51,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:51,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:33:51,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:33:51,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:51,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:51,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231484814] [2025-02-06 12:33:51,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231484814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:51,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:51,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638900253] [2025-02-06 12:33:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:51,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:33:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:51,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:33:51,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:33:52,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2025-02-06 12:33:52,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:52,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2025-02-06 12:33:52,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:52,201 INFO L124 PetriNetUnfolderBase]: 587/1373 cut-off events. [2025-02-06 12:33:52,202 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-02-06 12:33:52,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 1373 events. 587/1373 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7303 event pairs, 395 based on Foata normal form. 12/1223 useless extension candidates. Maximal degree in co-relation 1532. Up to 779 conditions per place. [2025-02-06 12:33:52,209 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 62 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-02-06 12:33:52,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 401 flow [2025-02-06 12:33:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2025-02-06 12:33:52,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2025-02-06 12:33:52,211 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 244 flow. Second operand 4 states and 358 transitions. [2025-02-06 12:33:52,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 401 flow [2025-02-06 12:33:52,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:52,214 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 252 flow [2025-02-06 12:33:52,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2025-02-06 12:33:52,215 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -22 predicate places. [2025-02-06 12:33:52,215 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 252 flow [2025-02-06 12:33:52,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:52,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:52,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:33:52,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:52,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1554101555, now seen corresponding path program 1 times [2025-02-06 12:33:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:52,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146894153] [2025-02-06 12:33:52,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:52,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:33:52,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:33:52,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:52,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146894153] [2025-02-06 12:33:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146894153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:52,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:52,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:52,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869316191] [2025-02-06 12:33:52,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:52,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:52,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:52,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:52,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:52,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-02-06 12:33:52,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:52,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-02-06 12:33:52,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:52,443 INFO L124 PetriNetUnfolderBase]: 572/1325 cut-off events. [2025-02-06 12:33:52,443 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-02-06 12:33:52,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 1325 events. 572/1325 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6924 event pairs, 515 based on Foata normal form. 31/1203 useless extension candidates. Maximal degree in co-relation 898. Up to 1007 conditions per place. [2025-02-06 12:33:52,448 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 50 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2025-02-06 12:33:52,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 94 transitions, 350 flow [2025-02-06 12:33:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2025-02-06 12:33:52,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6847545219638242 [2025-02-06 12:33:52,449 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 252 flow. Second operand 3 states and 265 transitions. [2025-02-06 12:33:52,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 94 transitions, 350 flow [2025-02-06 12:33:52,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 344 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:33:52,451 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 244 flow [2025-02-06 12:33:52,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-02-06 12:33:52,452 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -25 predicate places. [2025-02-06 12:33:52,452 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 244 flow [2025-02-06 12:33:52,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:52,452 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:52,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:33:52,452 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1507302901, now seen corresponding path program 1 times [2025-02-06 12:33:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642298616] [2025-02-06 12:33:52,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:52,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:33:52,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:33:52,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:52,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:52,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:52,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642298616] [2025-02-06 12:33:52,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642298616] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:33:52,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665570821] [2025-02-06 12:33:52,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:52,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:33:52,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:33:52,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:33:52,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:33:52,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:33:52,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:33:52,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:52,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 12:33:52,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:33:52,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 12:33:52,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-06 12:33:53,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:33:53,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2025-02-06 12:33:53,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-06 12:33:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:53,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:33:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665570821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:53,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 12:33:53,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 12 [2025-02-06 12:33:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020800937] [2025-02-06 12:33:53,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:53,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:33:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:53,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:33:53,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:33:53,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 129 [2025-02-06 12:33:53,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 70.75) internal successors, (566), 8 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:53,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:53,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 129 [2025-02-06 12:33:53,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:53,558 INFO L124 PetriNetUnfolderBase]: 643/1386 cut-off events. [2025-02-06 12:33:53,559 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-02-06 12:33:53,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 1386 events. 643/1386 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6898 event pairs, 168 based on Foata normal form. 0/1261 useless extension candidates. Maximal degree in co-relation 2829. Up to 771 conditions per place. [2025-02-06 12:33:53,564 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 87 selfloop transitions, 8 changer transitions 0/130 dead transitions. [2025-02-06 12:33:53,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 130 transitions, 509 flow [2025-02-06 12:33:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:33:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:33:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 571 transitions. [2025-02-06 12:33:53,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6323366555924695 [2025-02-06 12:33:53,566 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 244 flow. Second operand 7 states and 571 transitions. [2025-02-06 12:33:53,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 130 transitions, 509 flow [2025-02-06 12:33:53,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 130 transitions, 506 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:53,568 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 270 flow [2025-02-06 12:33:53,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2025-02-06 12:33:53,569 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -18 predicate places. [2025-02-06 12:33:53,569 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 270 flow [2025-02-06 12:33:53,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.75) internal successors, (566), 8 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:53,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:53,569 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:53,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:33:53,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 12:33:53,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:33:53,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1810087051, now seen corresponding path program 1 times [2025-02-06 12:33:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447225501] [2025-02-06 12:33:53,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:53,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:33:53,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:33:53,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:53,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:54,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:54,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447225501] [2025-02-06 12:33:54,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447225501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:33:54,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911648041] [2025-02-06 12:33:54,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:54,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:33:54,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:33:54,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:33:54,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:33:54,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:33:54,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:33:54,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:54,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:54,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 12:33:54,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:33:54,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 12:33:54,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-06 12:33:54,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:33:54,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2025-02-06 12:33:54,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-06 12:33:55,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 12:33:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:55,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:34:02,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse0 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_18| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| 8 (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_18|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_18|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_18| Int)) (or (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_18|) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_18|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 4) 4)))))))) is different from false [2025-02-06 12:34:02,802 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2025-02-06 12:34:02,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 236 [2025-02-06 12:34:02,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:34:02,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 85 treesize of output 85 [2025-02-06 12:34:02,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-06 12:34:02,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:34:02,909 INFO L378 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 71 treesize of output 73 [2025-02-06 12:34:02,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:34:02,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:34:02,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:34:02,993 INFO L378 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 45 [2025-02-06 12:34:03,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-02-06 12:34:03,010 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:34:03,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:34:03,016 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-06 12:34:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 12:34:03,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911648041] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:34:03,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:34:03,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 29 [2025-02-06 12:34:03,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060560909] [2025-02-06 12:34:03,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:34:03,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 12:34:03,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:03,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 12:34:03,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=736, Unknown=1, NotChecked=56, Total=930 [2025-02-06 12:34:03,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 129 [2025-02-06 12:34:03,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 270 flow. Second operand has 31 states, 31 states have (on average 28.516129032258064) internal successors, (884), 31 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:03,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:03,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 129 [2025-02-06 12:34:03,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:05,425 INFO L124 PetriNetUnfolderBase]: 1504/2877 cut-off events. [2025-02-06 12:34:05,425 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2025-02-06 12:34:05,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6296 conditions, 2877 events. 1504/2877 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 15033 event pairs, 263 based on Foata normal form. 24/2673 useless extension candidates. Maximal degree in co-relation 6280. Up to 1010 conditions per place. [2025-02-06 12:34:05,433 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 210 selfloop transitions, 19 changer transitions 0/245 dead transitions. [2025-02-06 12:34:05,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 245 transitions, 1085 flow [2025-02-06 12:34:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:34:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 12:34:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 594 transitions. [2025-02-06 12:34:05,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3289036544850498 [2025-02-06 12:34:05,435 INFO L175 Difference]: Start difference. First operand has 104 places, 95 transitions, 270 flow. Second operand 14 states and 594 transitions. [2025-02-06 12:34:05,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 245 transitions, 1085 flow [2025-02-06 12:34:05,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 245 transitions, 1073 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 12:34:05,440 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 360 flow [2025-02-06 12:34:05,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=360, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2025-02-06 12:34:05,441 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -7 predicate places. [2025-02-06 12:34:05,442 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 360 flow [2025-02-06 12:34:05,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 28.516129032258064) internal successors, (884), 31 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:05,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:05,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:05,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:34:05,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:05,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:34:05,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash 245022464, now seen corresponding path program 1 times [2025-02-06 12:34:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:05,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311997845] [2025-02-06 12:34:05,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:05,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:05,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 12:34:05,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 12:34:05,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:05,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:05,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311997845] [2025-02-06 12:34:05,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311997845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:05,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:05,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:34:05,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997389797] [2025-02-06 12:34:05,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:05,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:34:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:05,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:34:05,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:34:05,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2025-02-06 12:34:05,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:05,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:05,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2025-02-06 12:34:05,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:05,901 INFO L124 PetriNetUnfolderBase]: 1053/2417 cut-off events. [2025-02-06 12:34:05,901 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2025-02-06 12:34:05,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5274 conditions, 2417 events. 1053/2417 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 14381 event pairs, 968 based on Foata normal form. 7/2173 useless extension candidates. Maximal degree in co-relation 5255. Up to 1870 conditions per place. [2025-02-06 12:34:05,910 INFO L140 encePairwiseOnDemand]: 127/129 looper letters, 60 selfloop transitions, 1 changer transitions 3/107 dead transitions. [2025-02-06 12:34:05,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 107 transitions, 484 flow [2025-02-06 12:34:05,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:34:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:34:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2025-02-06 12:34:05,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2025-02-06 12:34:05,912 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 360 flow. Second operand 3 states and 267 transitions. [2025-02-06 12:34:05,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 107 transitions, 484 flow [2025-02-06 12:34:05,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 107 transitions, 456 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-06 12:34:05,918 INFO L231 Difference]: Finished difference. Result has 111 places, 104 transitions, 324 flow [2025-02-06 12:34:05,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2025-02-06 12:34:05,918 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -11 predicate places. [2025-02-06 12:34:05,918 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 324 flow [2025-02-06 12:34:05,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:05,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:05,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:05,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:34:05,919 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:34:05,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1334944273, now seen corresponding path program 1 times [2025-02-06 12:34:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839326855] [2025-02-06 12:34:05,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:05,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:34:05,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:34:05,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:05,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:05,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:05,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839326855] [2025-02-06 12:34:05,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839326855] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:34:05,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927924875] [2025-02-06 12:34:05,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:05,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:05,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:34:05,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:34:05,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:34:06,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:34:06,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:34:06,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:06,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:06,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:34:06,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:34:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:06,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:34:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:06,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927924875] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:34:06,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:34:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:34:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813999092] [2025-02-06 12:34:06,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:34:06,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:34:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:06,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:34:06,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:34:06,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2025-02-06 12:34:06,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 81.14285714285714) internal successors, (568), 7 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:06,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:06,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2025-02-06 12:34:06,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:06,453 INFO L124 PetriNetUnfolderBase]: 1527/3400 cut-off events. [2025-02-06 12:34:06,453 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2025-02-06 12:34:06,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7541 conditions, 3400 events. 1527/3400 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 19585 event pairs, 476 based on Foata normal form. 72/3181 useless extension candidates. Maximal degree in co-relation 7523. Up to 937 conditions per place. [2025-02-06 12:34:06,464 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 114 selfloop transitions, 8 changer transitions 0/165 dead transitions. [2025-02-06 12:34:06,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 165 transitions, 757 flow [2025-02-06 12:34:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:34:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:34:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2025-02-06 12:34:06,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.710594315245478 [2025-02-06 12:34:06,466 INFO L175 Difference]: Start difference. First operand has 111 places, 104 transitions, 324 flow. Second operand 6 states and 550 transitions. [2025-02-06 12:34:06,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 165 transitions, 757 flow [2025-02-06 12:34:06,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 165 transitions, 756 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:34:06,470 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 385 flow [2025-02-06 12:34:06,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2025-02-06 12:34:06,471 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -5 predicate places. [2025-02-06 12:34:06,471 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 385 flow [2025-02-06 12:34:06,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.14285714285714) internal successors, (568), 7 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:06,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:06,472 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:06,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:34:06,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:06,672 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:34:06,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1871618648, now seen corresponding path program 1 times [2025-02-06 12:34:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:06,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722807871] [2025-02-06 12:34:06,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:06,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:06,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:34:06,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:34:06,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:06,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:06,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:06,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722807871] [2025-02-06 12:34:06,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722807871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:34:06,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566479763] [2025-02-06 12:34:06,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:06,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:06,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:34:06,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:34:06,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:34:06,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:34:06,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:34:06,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:06,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:06,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:34:06,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:34:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:07,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:34:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:07,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566479763] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:34:07,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:34:07,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-02-06 12:34:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350994948] [2025-02-06 12:34:07,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:34:07,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:34:07,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:07,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:34:07,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:34:08,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2025-02-06 12:34:08,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 385 flow. Second operand has 12 states, 12 states have (on average 79.25) internal successors, (951), 12 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:08,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:08,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2025-02-06 12:34:08,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:08,783 INFO L124 PetriNetUnfolderBase]: 1527/3292 cut-off events. [2025-02-06 12:34:08,783 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2025-02-06 12:34:08,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7820 conditions, 3292 events. 1527/3292 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 18242 event pairs, 203 based on Foata normal form. 96/3103 useless extension candidates. Maximal degree in co-relation 7799. Up to 798 conditions per place. [2025-02-06 12:34:08,807 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 120 selfloop transitions, 9 changer transitions 3/174 dead transitions. [2025-02-06 12:34:08,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 174 transitions, 842 flow [2025-02-06 12:34:08,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:34:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:34:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 700 transitions. [2025-02-06 12:34:08,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6782945736434108 [2025-02-06 12:34:08,812 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 385 flow. Second operand 8 states and 700 transitions. [2025-02-06 12:34:08,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 174 transitions, 842 flow [2025-02-06 12:34:08,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 174 transitions, 832 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 12:34:08,819 INFO L231 Difference]: Finished difference. Result has 121 places, 108 transitions, 389 flow [2025-02-06 12:34:08,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=389, PETRI_PLACES=121, PETRI_TRANSITIONS=108} [2025-02-06 12:34:08,819 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -1 predicate places. [2025-02-06 12:34:08,819 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 108 transitions, 389 flow [2025-02-06 12:34:08,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.25) internal successors, (951), 12 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:08,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:08,820 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:08,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:34:09,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 12:34:09,022 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-02-06 12:34:09,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1370345611, now seen corresponding path program 1 times [2025-02-06 12:34:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:09,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280216540] [2025-02-06 12:34:09,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:09,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 12:34:09,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 12:34:09,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:09,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 12:34:09,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280216540] [2025-02-06 12:34:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280216540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:34:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768695457] [2025-02-06 12:34:09,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:09,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:34:09,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:34:09,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:34:09,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 12:34:09,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 12:34:09,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:09,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:09,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-06 12:34:09,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:34:09,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 12:34:09,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-06 12:34:09,910 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-02-06 12:34:09,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2025-02-06 12:34:09,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-06 12:34:10,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 12:34:10,098 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-02-06 12:34:10,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2025-02-06 12:34:10,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 14 [2025-02-06 12:34:10,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 12:34:10,368 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-02-06 12:34:10,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2025-02-06 12:34:10,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 14 [2025-02-06 12:34:10,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-06 12:34:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:10,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:34:14,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#1| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse4 .cse2)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_37| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_37|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (forall ((v_ArrVal_382 Int)) (<= (+ (* (select (select (store |c_#memory_int#1| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_382) .cse2 1)) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< 20 (select .cse0 .cse2))))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_37|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_37| Int)) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_37|) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_37|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (< 20 (select .cse6 .cse2)) (forall ((v_ArrVal_382 Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#1| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse1 v_ArrVal_382) .cse2 1)) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))))) is different from false