./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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.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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:36:20,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:36:20,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:36:20,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:36:20,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:36:20,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:36:20,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:36:20,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:36:20,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:36:20,947 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:36:20,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:36:20,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:36:20,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:36:20,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:36:20,947 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:36:20,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:36:20,947 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:36:20,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:36:20,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:36:20,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:36:20,948 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:36:20,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:36:20,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:36:20,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:36:20,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:36:20,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:36:20,950 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-01-10 00:36:21,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:36:21,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:36:21,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:36:21,166 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:36:21,166 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:36:21,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-01-10 00:36:22,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f7d08886/b8e5199a5e20465592a6dd74e54dbb43/FLAG0efafdd34 [2025-01-10 00:36:22,492 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:36:22,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-01-10 00:36:22,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f7d08886/b8e5199a5e20465592a6dd74e54dbb43/FLAG0efafdd34 [2025-01-10 00:36:22,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f7d08886/b8e5199a5e20465592a6dd74e54dbb43 [2025-01-10 00:36:22,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:36:22,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:36:22,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:36:22,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:36:22,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:36:22,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:22" (1/1) ... [2025-01-10 00:36:22,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:22, skipping insertion in model container [2025-01-10 00:36:22,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:22" (1/1) ... [2025-01-10 00:36:22,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:36:23,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:36:23,113 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:36:23,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:36:23,197 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:36:23,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23 WrapperNode [2025-01-10 00:36:23,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:36:23,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:36:23,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:36:23,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:36:23,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,239 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 289 [2025-01-10 00:36:23,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:36:23,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:36:23,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:36:23,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:36:23,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,275 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2025-01-10 00:36:23,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:36:23,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:36:23,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:36:23,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:36:23,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (1/1) ... [2025-01-10 00:36:23,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:36:23,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:36:23,321 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-01-10 00:36:23,322 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-01-10 00:36:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 00:36:23,336 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 00:36:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 00:36:23,336 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 00:36:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:36:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:36:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:36:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:36:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:36:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 00:36:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:36:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:36:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:36:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:36:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:36:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:36:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:36:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:36:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:36:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:36:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:36:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:36:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:36:23,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:36:23,339 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:36:23,469 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:36:23,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:36:23,919 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:36:23,920 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:36:24,148 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:36:24,149 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:36:24,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:36:24 BoogieIcfgContainer [2025-01-10 00:36:24,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:36:24,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:36:24,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:36:24,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:36:24,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:36:22" (1/3) ... [2025-01-10 00:36:24,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cec4fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:36:24, skipping insertion in model container [2025-01-10 00:36:24,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:23" (2/3) ... [2025-01-10 00:36:24,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cec4fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:36:24, skipping insertion in model container [2025-01-10 00:36:24,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:36:24" (3/3) ... [2025-01-10 00:36:24,156 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-01-10 00:36:24,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:36:24,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations. [2025-01-10 00:36:24,169 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:36:24,254 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:36:24,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 358 flow [2025-01-10 00:36:24,358 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2025-01-10 00:36:24,360 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:36:24,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 527 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2025-01-10 00:36:24,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 358 flow [2025-01-10 00:36:24,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 169 transitions, 350 flow [2025-01-10 00:36:24,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:36:24,386 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;@1bc8643d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:36:24,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 134 error locations. [2025-01-10 00:36:24,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:36:24,390 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:36:24,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:36:24,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:24,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:36:24,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:24,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:24,394 INFO L85 PathProgramCache]: Analyzing trace with hash 24680, now seen corresponding path program 1 times [2025-01-10 00:36:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740047209] [2025-01-10 00:36:24,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:24,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:24,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:36:24,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:36:24,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:24,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:24,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-01-10 00:36:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:24,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740047209] [2025-01-10 00:36:24,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740047209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:24,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:24,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:24,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450757382] [2025-01-10 00:36:24,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:24,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:24,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:24,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:24,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-01-10 00:36:24,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-01-10 00:36:24,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:24,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-01-10 00:36:24,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:25,229 INFO L124 PetriNetUnfolderBase]: 1744/4652 cut-off events. [2025-01-10 00:36:25,229 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 00:36:25,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7477 conditions, 4652 events. 1744/4652 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37009 event pairs, 1393 based on Foata normal form. 182/3586 useless extension candidates. Maximal degree in co-relation 7362. Up to 2744 conditions per place. [2025-01-10 00:36:25,251 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-01-10 00:36:25,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 436 flow [2025-01-10 00:36:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-01-10 00:36:25,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2025-01-10 00:36:25,262 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 350 flow. Second operand 3 states and 364 transitions. [2025-01-10 00:36:25,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 436 flow [2025-01-10 00:36:25,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 153 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:36:25,270 INFO L231 Difference]: Finished difference. Result has 150 places, 153 transitions, 314 flow [2025-01-10 00:36:25,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=150, PETRI_TRANSITIONS=153} [2025-01-10 00:36:25,275 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -12 predicate places. [2025-01-10 00:36:25,275 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 153 transitions, 314 flow [2025-01-10 00:36:25,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-01-10 00:36:25,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:25,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:36:25,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:36:25,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:25,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 24681, now seen corresponding path program 1 times [2025-01-10 00:36:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304185118] [2025-01-10 00:36:25,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:25,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:36:25,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:36:25,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:25,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:25,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304185118] [2025-01-10 00:36:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304185118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:25,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:25,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583718908] [2025-01-10 00:36:25,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:25,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:25,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:25,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:25,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-01-10 00:36:25,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 153 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-01-10 00:36:25,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:25,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-01-10 00:36:25,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:25,943 INFO L124 PetriNetUnfolderBase]: 1744/4649 cut-off events. [2025-01-10 00:36:25,944 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 00:36:25,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7428 conditions, 4649 events. 1744/4649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37047 event pairs, 1393 based on Foata normal form. 3/3406 useless extension candidates. Maximal degree in co-relation 7417. Up to 2744 conditions per place. [2025-01-10 00:36:25,962 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-01-10 00:36:25,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 150 transitions, 426 flow [2025-01-10 00:36:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-01-10 00:36:25,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271 [2025-01-10 00:36:25,964 INFO L175 Difference]: Start difference. First operand has 150 places, 153 transitions, 314 flow. Second operand 3 states and 359 transitions. [2025-01-10 00:36:25,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 150 transitions, 426 flow [2025-01-10 00:36:25,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 150 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:25,966 INFO L231 Difference]: Finished difference. Result has 147 places, 150 transitions, 308 flow [2025-01-10 00:36:25,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=150} [2025-01-10 00:36:25,967 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -15 predicate places. [2025-01-10 00:36:25,967 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 308 flow [2025-01-10 00:36:25,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-01-10 00:36:25,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:25,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:36:25,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:36:25,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:25,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:25,968 INFO L85 PathProgramCache]: Analyzing trace with hash 735994994, now seen corresponding path program 1 times [2025-01-10 00:36:25,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:25,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001989150] [2025-01-10 00:36:25,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:25,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:25,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:36:25,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:36:25,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:25,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:26,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-01-10 00:36:26,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:26,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001989150] [2025-01-10 00:36:26,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001989150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:26,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:26,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:26,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105349187] [2025-01-10 00:36:26,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:26,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:26,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:26,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:26,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:26,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-01-10 00:36:26,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 150 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-01-10 00:36:26,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:26,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-01-10 00:36:26,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:26,470 INFO L124 PetriNetUnfolderBase]: 1744/4647 cut-off events. [2025-01-10 00:36:26,470 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 00:36:26,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 4647 events. 1744/4647 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36938 event pairs, 1393 based on Foata normal form. 1/3404 useless extension candidates. Maximal degree in co-relation 7415. Up to 2743 conditions per place. [2025-01-10 00:36:26,489 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 56 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2025-01-10 00:36:26,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 148 transitions, 422 flow [2025-01-10 00:36:26,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2025-01-10 00:36:26,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700581395348837 [2025-01-10 00:36:26,492 INFO L175 Difference]: Start difference. First operand has 147 places, 150 transitions, 308 flow. Second operand 4 states and 461 transitions. [2025-01-10 00:36:26,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 148 transitions, 422 flow [2025-01-10 00:36:26,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 148 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:26,495 INFO L231 Difference]: Finished difference. Result has 146 places, 148 transitions, 306 flow [2025-01-10 00:36:26,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=146, PETRI_TRANSITIONS=148} [2025-01-10 00:36:26,498 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -16 predicate places. [2025-01-10 00:36:26,498 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 148 transitions, 306 flow [2025-01-10 00:36:26,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-01-10 00:36:26,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:26,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:36:26,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:36:26,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:26,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash 735994995, now seen corresponding path program 1 times [2025-01-10 00:36:26,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:26,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608491475] [2025-01-10 00:36:26,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:26,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:26,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:36:26,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:36:26,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:26,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:26,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:26,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608491475] [2025-01-10 00:36:26,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608491475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:26,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:26,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167406220] [2025-01-10 00:36:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:26,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:26,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:26,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:26,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-01-10 00:36:26,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 148 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-01-10 00:36:26,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:26,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-01-10 00:36:26,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:27,018 INFO L124 PetriNetUnfolderBase]: 1744/4645 cut-off events. [2025-01-10 00:36:27,018 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 00:36:27,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7425 conditions, 4645 events. 1744/4645 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36964 event pairs, 1393 based on Foata normal form. 2/3404 useless extension candidates. Maximal degree in co-relation 7410. Up to 2743 conditions per place. [2025-01-10 00:36:27,037 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 56 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2025-01-10 00:36:27,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 420 flow [2025-01-10 00:36:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2025-01-10 00:36:27,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700581395348837 [2025-01-10 00:36:27,038 INFO L175 Difference]: Start difference. First operand has 146 places, 148 transitions, 306 flow. Second operand 4 states and 461 transitions. [2025-01-10 00:36:27,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 420 flow [2025-01-10 00:36:27,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 146 transitions, 414 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:27,041 INFO L231 Difference]: Finished difference. Result has 144 places, 146 transitions, 302 flow [2025-01-10 00:36:27,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=144, PETRI_TRANSITIONS=146} [2025-01-10 00:36:27,041 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -18 predicate places. [2025-01-10 00:36:27,041 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 146 transitions, 302 flow [2025-01-10 00:36:27,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-01-10 00:36:27,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:27,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:27,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:36:27,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:27,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1438475939, now seen corresponding path program 1 times [2025-01-10 00:36:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:27,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608458548] [2025-01-10 00:36:27,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:27,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:36:27,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:36:27,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:27,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:27,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:27,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608458548] [2025-01-10 00:36:27,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608458548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:27,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:27,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:27,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221471139] [2025-01-10 00:36:27,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:27,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:27,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:27,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:27,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:27,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 172 [2025-01-10 00:36:27,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 146 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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-01-10 00:36:27,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:27,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 172 [2025-01-10 00:36:27,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:27,599 INFO L124 PetriNetUnfolderBase]: 1703/4144 cut-off events. [2025-01-10 00:36:27,599 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 00:36:27,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6880 conditions, 4144 events. 1703/4144 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 30733 event pairs, 702 based on Foata normal form. 204/3608 useless extension candidates. Maximal degree in co-relation 6865. Up to 1413 conditions per place. [2025-01-10 00:36:27,610 INFO L140 encePairwiseOnDemand]: 151/172 looper letters, 73 selfloop transitions, 5 changer transitions 0/149 dead transitions. [2025-01-10 00:36:27,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 149 transitions, 465 flow [2025-01-10 00:36:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2025-01-10 00:36:27,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6366279069767442 [2025-01-10 00:36:27,612 INFO L175 Difference]: Start difference. First operand has 144 places, 146 transitions, 302 flow. Second operand 4 states and 438 transitions. [2025-01-10 00:36:27,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 149 transitions, 465 flow [2025-01-10 00:36:27,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 149 transitions, 459 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:27,614 INFO L231 Difference]: Finished difference. Result has 128 places, 130 transitions, 274 flow [2025-01-10 00:36:27,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=128, PETRI_TRANSITIONS=130} [2025-01-10 00:36:27,614 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -34 predicate places. [2025-01-10 00:36:27,614 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 274 flow [2025-01-10 00:36:27,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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-01-10 00:36:27,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:27,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:27,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:36:27,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:27,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1438475938, now seen corresponding path program 1 times [2025-01-10 00:36:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517620654] [2025-01-10 00:36:27,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:27,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:36:27,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:36:27,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:27,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:27,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:27,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517620654] [2025-01-10 00:36:27,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517620654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:27,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:27,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045524103] [2025-01-10 00:36:27,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:27,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:27,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:27,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:27,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 172 [2025-01-10 00:36:27,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-01-10 00:36:27,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:27,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 172 [2025-01-10 00:36:27,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:28,096 INFO L124 PetriNetUnfolderBase]: 1703/3675 cut-off events. [2025-01-10 00:36:28,097 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-01-10 00:36:28,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6545 conditions, 3675 events. 1703/3675 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 24508 event pairs, 702 based on Foata normal form. 204/3340 useless extension candidates. Maximal degree in co-relation 2518. Up to 1413 conditions per place. [2025-01-10 00:36:28,109 INFO L140 encePairwiseOnDemand]: 153/172 looper letters, 73 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-01-10 00:36:28,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 135 transitions, 441 flow [2025-01-10 00:36:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2025-01-10 00:36:28,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453488372093024 [2025-01-10 00:36:28,110 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 274 flow. Second operand 4 states and 444 transitions. [2025-01-10 00:36:28,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 135 transitions, 441 flow [2025-01-10 00:36:28,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 135 transitions, 431 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:28,113 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 246 flow [2025-01-10 00:36:28,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2025-01-10 00:36:28,113 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places. [2025-01-10 00:36:28,113 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 246 flow [2025-01-10 00:36:28,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-01-10 00:36:28,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:28,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:28,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:36:28,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:28,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:28,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1643080292, now seen corresponding path program 1 times [2025-01-10 00:36:28,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:28,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531957575] [2025-01-10 00:36:28,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:28,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:28,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:36:28,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:36:28,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:28,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:28,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:28,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531957575] [2025-01-10 00:36:28,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531957575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:28,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:28,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:36:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581840618] [2025-01-10 00:36:28,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:28,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:36:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:28,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:36:28,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:36:28,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172 [2025-01-10 00:36:28,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 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-01-10 00:36:28,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:28,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172 [2025-01-10 00:36:28,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:29,294 INFO L124 PetriNetUnfolderBase]: 2502/5391 cut-off events. [2025-01-10 00:36:29,294 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-10 00:36:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9547 conditions, 5391 events. 2502/5391 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 38796 event pairs, 536 based on Foata normal form. 0/4393 useless extension candidates. Maximal degree in co-relation 3717. Up to 3436 conditions per place. [2025-01-10 00:36:29,309 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 124 selfloop transitions, 11 changer transitions 0/183 dead transitions. [2025-01-10 00:36:29,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 183 transitions, 655 flow [2025-01-10 00:36:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:36:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:36:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 669 transitions. [2025-01-10 00:36:29,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5556478405315615 [2025-01-10 00:36:29,311 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 246 flow. Second operand 7 states and 669 transitions. [2025-01-10 00:36:29,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 183 transitions, 655 flow [2025-01-10 00:36:29,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 643 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:29,316 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 310 flow [2025-01-10 00:36:29,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2025-01-10 00:36:29,317 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -41 predicate places. [2025-01-10 00:36:29,317 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 310 flow [2025-01-10 00:36:29,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 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-01-10 00:36:29,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:29,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:29,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:36:29,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:29,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash 785131107, now seen corresponding path program 1 times [2025-01-10 00:36:29,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:29,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701010154] [2025-01-10 00:36:29,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:29,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:29,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:36:29,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:36:29,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:29,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:29,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701010154] [2025-01-10 00:36:29,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701010154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:29,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:29,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:29,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896014376] [2025-01-10 00:36:29,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:29,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:29,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:29,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:29,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:29,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-01-10 00:36:29,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-01-10 00:36:29,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:29,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-01-10 00:36:29,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:29,609 INFO L124 PetriNetUnfolderBase]: 1382/3218 cut-off events. [2025-01-10 00:36:29,609 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 00:36:29,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 3218 events. 1382/3218 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19613 event pairs, 703 based on Foata normal form. 55/2726 useless extension candidates. Maximal degree in co-relation 5605. Up to 1211 conditions per place. [2025-01-10 00:36:29,617 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 80 selfloop transitions, 3 changer transitions 0/139 dead transitions. [2025-01-10 00:36:29,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 139 transitions, 476 flow [2025-01-10 00:36:29,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2025-01-10 00:36:29,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-01-10 00:36:29,619 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 310 flow. Second operand 3 states and 390 transitions. [2025-01-10 00:36:29,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 139 transitions, 476 flow [2025-01-10 00:36:29,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 139 transitions, 451 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-01-10 00:36:29,624 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 249 flow [2025-01-10 00:36:29,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2025-01-10 00:36:29,625 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places. [2025-01-10 00:36:29,626 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 249 flow [2025-01-10 00:36:29,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-01-10 00:36:29,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:29,627 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] [2025-01-10 00:36:29,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:36:29,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:29,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1648308619, now seen corresponding path program 1 times [2025-01-10 00:36:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986627205] [2025-01-10 00:36:29,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:29,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:36:29,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:36:29,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:29,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:29,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986627205] [2025-01-10 00:36:29,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986627205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:29,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604352419] [2025-01-10 00:36:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:29,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:29,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:29,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:29,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:29,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-01-10 00:36:29,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-01-10 00:36:29,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:29,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-01-10 00:36:29,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:29,952 INFO L124 PetriNetUnfolderBase]: 1392/3289 cut-off events. [2025-01-10 00:36:29,952 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-01-10 00:36:29,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5671 conditions, 3289 events. 1392/3289 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20441 event pairs, 1089 based on Foata normal form. 77/2806 useless extension candidates. Maximal degree in co-relation 5666. Up to 2215 conditions per place. [2025-01-10 00:36:29,961 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/113 dead transitions. [2025-01-10 00:36:29,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 363 flow [2025-01-10 00:36:29,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-01-10 00:36:29,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271 [2025-01-10 00:36:29,963 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 249 flow. Second operand 3 states and 359 transitions. [2025-01-10 00:36:29,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 363 flow [2025-01-10 00:36:29,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:29,965 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 242 flow [2025-01-10 00:36:29,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-01-10 00:36:29,966 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places. [2025-01-10 00:36:29,967 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 242 flow [2025-01-10 00:36:29,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-01-10 00:36:29,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:29,967 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] [2025-01-10 00:36:29,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:36:29,967 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:29,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1648308620, now seen corresponding path program 1 times [2025-01-10 00:36:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:29,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475425278] [2025-01-10 00:36:29,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:29,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:36:29,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:36:29,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:29,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475425278] [2025-01-10 00:36:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475425278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:30,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335543472] [2025-01-10 00:36:30,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:30,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:30,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:30,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:30,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-01-10 00:36:30,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-01-10 00:36:30,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:30,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-01-10 00:36:30,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:30,345 INFO L124 PetriNetUnfolderBase]: 1392/3277 cut-off events. [2025-01-10 00:36:30,345 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 00:36:30,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 3277 events. 1392/3277 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20295 event pairs, 1089 based on Foata normal form. 0/2717 useless extension candidates. Maximal degree in co-relation 5641. Up to 2215 conditions per place. [2025-01-10 00:36:30,355 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/112 dead transitions. [2025-01-10 00:36:30,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 360 flow [2025-01-10 00:36:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-01-10 00:36:30,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7034883720930233 [2025-01-10 00:36:30,358 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 242 flow. Second operand 3 states and 363 transitions. [2025-01-10 00:36:30,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 360 flow [2025-01-10 00:36:30,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:30,361 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 241 flow [2025-01-10 00:36:30,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2025-01-10 00:36:30,362 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places. [2025-01-10 00:36:30,362 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 241 flow [2025-01-10 00:36:30,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-01-10 00:36:30,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:30,362 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-01-10 00:36:30,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:36:30,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:30,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash -442039381, now seen corresponding path program 1 times [2025-01-10 00:36:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657900852] [2025-01-10 00:36:30,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:30,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:36:30,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:36:30,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:30,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:30,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:30,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657900852] [2025-01-10 00:36:30,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657900852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:30,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:30,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315600873] [2025-01-10 00:36:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:30,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:30,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:30,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:30,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-01-10 00:36:30,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-01-10 00:36:30,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:30,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-01-10 00:36:30,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:30,738 INFO L124 PetriNetUnfolderBase]: 1392/3253 cut-off events. [2025-01-10 00:36:30,739 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 00:36:30,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5623 conditions, 3253 events. 1392/3253 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20040 event pairs, 1074 based on Foata normal form. 12/2729 useless extension candidates. Maximal degree in co-relation 5618. Up to 2186 conditions per place. [2025-01-10 00:36:30,748 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 65 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2025-01-10 00:36:30,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 118 transitions, 390 flow [2025-01-10 00:36:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2025-01-10 00:36:30,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816860465116279 [2025-01-10 00:36:30,750 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 241 flow. Second operand 4 states and 469 transitions. [2025-01-10 00:36:30,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 118 transitions, 390 flow [2025-01-10 00:36:30,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 118 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:30,751 INFO L231 Difference]: Finished difference. Result has 112 places, 110 transitions, 242 flow [2025-01-10 00:36:30,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=112, PETRI_TRANSITIONS=110} [2025-01-10 00:36:30,752 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places. [2025-01-10 00:36:30,752 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 110 transitions, 242 flow [2025-01-10 00:36:30,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-01-10 00:36:30,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:30,752 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-01-10 00:36:30,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:36:30,752 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:30,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash -442039380, now seen corresponding path program 1 times [2025-01-10 00:36:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527947212] [2025-01-10 00:36:30,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:30,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:36:30,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:36:30,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:30,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:30,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527947212] [2025-01-10 00:36:30,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527947212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:30,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:30,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:30,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493820630] [2025-01-10 00:36:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:30,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:30,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:30,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:30,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-01-10 00:36:30,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 110 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-01-10 00:36:30,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:30,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-01-10 00:36:30,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:31,200 INFO L124 PetriNetUnfolderBase]: 1392/3229 cut-off events. [2025-01-10 00:36:31,201 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 00:36:31,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5624 conditions, 3229 events. 1392/3229 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19772 event pairs, 1074 based on Foata normal form. 24/2729 useless extension candidates. Maximal degree in co-relation 5619. Up to 2186 conditions per place. [2025-01-10 00:36:31,210 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 65 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-01-10 00:36:31,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 116 transitions, 391 flow [2025-01-10 00:36:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2025-01-10 00:36:31,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816860465116279 [2025-01-10 00:36:31,212 INFO L175 Difference]: Start difference. First operand has 112 places, 110 transitions, 242 flow. Second operand 4 states and 469 transitions. [2025-01-10 00:36:31,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 116 transitions, 391 flow [2025-01-10 00:36:31,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 385 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:31,214 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 238 flow [2025-01-10 00:36:31,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2025-01-10 00:36:31,216 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -52 predicate places. [2025-01-10 00:36:31,216 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 238 flow [2025-01-10 00:36:31,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-01-10 00:36:31,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:31,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-01-10 00:36:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:36:31,216 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:31,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash -818350736, now seen corresponding path program 1 times [2025-01-10 00:36:31,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:31,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185002207] [2025-01-10 00:36:31,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:31,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:36:31,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:36:31,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:31,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:31,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185002207] [2025-01-10 00:36:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185002207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:31,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:36:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264048843] [2025-01-10 00:36:31,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:31,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:31,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:31,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:31,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:31,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-01-10 00:36:31,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-01-10 00:36:31,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:31,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-01-10 00:36:31,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:31,447 INFO L124 PetriNetUnfolderBase]: 1380/3217 cut-off events. [2025-01-10 00:36:31,447 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 00:36:31,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5600 conditions, 3217 events. 1380/3217 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19752 event pairs, 1074 based on Foata normal form. 0/2705 useless extension candidates. Maximal degree in co-relation 5595. Up to 2175 conditions per place. [2025-01-10 00:36:31,457 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 65 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-01-10 00:36:31,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 115 transitions, 387 flow [2025-01-10 00:36:31,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-01-10 00:36:31,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7228682170542635 [2025-01-10 00:36:31,459 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 238 flow. Second operand 3 states and 373 transitions. [2025-01-10 00:36:31,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 115 transitions, 387 flow [2025-01-10 00:36:31,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 381 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:31,461 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 234 flow [2025-01-10 00:36:31,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-01-10 00:36:31,462 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -53 predicate places. [2025-01-10 00:36:31,462 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 234 flow [2025-01-10 00:36:31,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-01-10 00:36:31,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:31,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:31,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:36:31,463 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:31,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1439114, now seen corresponding path program 1 times [2025-01-10 00:36:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:31,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009676722] [2025-01-10 00:36:31,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:31,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:31,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:36:31,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:36:31,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:31,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:32,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:32,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009676722] [2025-01-10 00:36:32,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009676722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:32,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:32,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:36:32,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600371014] [2025-01-10 00:36:32,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:32,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:36:32,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:32,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:36:32,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:36:32,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-01-10 00:36:32,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 234 flow. Second operand has 14 states, 14 states have (on average 94.57142857142857) internal successors, (1324), 14 states have internal predecessors, (1324), 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-01-10 00:36:32,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:32,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-01-10 00:36:32,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:33,529 INFO L124 PetriNetUnfolderBase]: 1847/4004 cut-off events. [2025-01-10 00:36:33,529 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 00:36:33,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7252 conditions, 4004 events. 1847/4004 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 24504 event pairs, 382 based on Foata normal form. 0/3520 useless extension candidates. Maximal degree in co-relation 7247. Up to 2245 conditions per place. [2025-01-10 00:36:33,543 INFO L140 encePairwiseOnDemand]: 158/172 looper letters, 143 selfloop transitions, 14 changer transitions 0/196 dead transitions. [2025-01-10 00:36:33,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 196 transitions, 741 flow [2025-01-10 00:36:33,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:36:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:36:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1366 transitions. [2025-01-10 00:36:33,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.610912343470483 [2025-01-10 00:36:33,546 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 234 flow. Second operand 13 states and 1366 transitions. [2025-01-10 00:36:33,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 196 transitions, 741 flow [2025-01-10 00:36:33,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 196 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:33,549 INFO L231 Difference]: Finished difference. Result has 123 places, 113 transitions, 292 flow [2025-01-10 00:36:33,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=292, PETRI_PLACES=123, PETRI_TRANSITIONS=113} [2025-01-10 00:36:33,550 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -39 predicate places. [2025-01-10 00:36:33,550 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 292 flow [2025-01-10 00:36:33,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 94.57142857142857) internal successors, (1324), 14 states have internal predecessors, (1324), 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-01-10 00:36:33,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:33,550 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-01-10 00:36:33,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:36:33,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:33,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1637555164, now seen corresponding path program 1 times [2025-01-10 00:36:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526950073] [2025-01-10 00:36:33,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:33,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:36:33,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:36:33,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:33,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:34,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:34,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526950073] [2025-01-10 00:36:34,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526950073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:34,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:34,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:36:34,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543717489] [2025-01-10 00:36:34,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:34,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:36:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:34,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:36:34,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:36:35,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-01-10 00:36:35,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 292 flow. Second operand has 14 states, 14 states have (on average 94.64285714285714) internal successors, (1325), 14 states have internal predecessors, (1325), 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-01-10 00:36:35,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:35,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-01-10 00:36:35,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:35,811 INFO L124 PetriNetUnfolderBase]: 1918/4006 cut-off events. [2025-01-10 00:36:35,811 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-01-10 00:36:35,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7615 conditions, 4006 events. 1918/4006 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 23850 event pairs, 434 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 7606. Up to 1950 conditions per place. [2025-01-10 00:36:35,823 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 127 selfloop transitions, 19 changer transitions 0/182 dead transitions. [2025-01-10 00:36:35,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 182 transitions, 732 flow [2025-01-10 00:36:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:36:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:36:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1256 transitions. [2025-01-10 00:36:35,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6085271317829457 [2025-01-10 00:36:35,826 INFO L175 Difference]: Start difference. First operand has 123 places, 113 transitions, 292 flow. Second operand 12 states and 1256 transitions. [2025-01-10 00:36:35,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 182 transitions, 732 flow [2025-01-10 00:36:35,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 182 transitions, 719 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:36:35,829 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 321 flow [2025-01-10 00:36:35,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=321, PETRI_PLACES=125, PETRI_TRANSITIONS=110} [2025-01-10 00:36:35,829 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -37 predicate places. [2025-01-10 00:36:35,830 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 321 flow [2025-01-10 00:36:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 94.64285714285714) internal successors, (1325), 14 states have internal predecessors, (1325), 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-01-10 00:36:35,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:35,830 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] [2025-01-10 00:36:35,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:36:35,830 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:35,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash -792148649, now seen corresponding path program 1 times [2025-01-10 00:36:35,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:35,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151541356] [2025-01-10 00:36:35,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:35,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:35,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 00:36:35,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 00:36:35,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:35,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151541356] [2025-01-10 00:36:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151541356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:36:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638321045] [2025-01-10 00:36:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:36:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:36,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:36:36,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:36:36,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 172 [2025-01-10 00:36:36,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 321 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 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-01-10 00:36:36,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:36,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 172 [2025-01-10 00:36:36,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:37,012 INFO L124 PetriNetUnfolderBase]: 3132/6246 cut-off events. [2025-01-10 00:36:37,012 INFO L125 PetriNetUnfolderBase]: For 507/507 co-relation queries the response was YES. [2025-01-10 00:36:37,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12286 conditions, 6246 events. 3132/6246 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 39392 event pairs, 536 based on Foata normal form. 80/5731 useless extension candidates. Maximal degree in co-relation 12276. Up to 1657 conditions per place. [2025-01-10 00:36:37,033 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 167 selfloop transitions, 21 changer transitions 0/226 dead transitions. [2025-01-10 00:36:37,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 226 transitions, 965 flow [2025-01-10 00:36:37,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:36:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:36:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 818 transitions. [2025-01-10 00:36:37,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5944767441860465 [2025-01-10 00:36:37,036 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 321 flow. Second operand 8 states and 818 transitions. [2025-01-10 00:36:37,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 226 transitions, 965 flow [2025-01-10 00:36:37,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 226 transitions, 929 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-01-10 00:36:37,040 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 419 flow [2025-01-10 00:36:37,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=419, PETRI_PLACES=127, PETRI_TRANSITIONS=124} [2025-01-10 00:36:37,041 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -35 predicate places. [2025-01-10 00:36:37,041 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 419 flow [2025-01-10 00:36:37,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 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-01-10 00:36:37,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:37,041 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-01-10 00:36:37,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:36:37,041 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:37,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash 459859709, now seen corresponding path program 1 times [2025-01-10 00:36:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120352104] [2025-01-10 00:36:37,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:37,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:37,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:36:37,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:36:37,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:37,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120352104] [2025-01-10 00:36:37,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120352104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:36:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875526623] [2025-01-10 00:36:37,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:37,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:36:37,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:36:37,526 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-01-10 00:36:37,527 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-01-10 00:36:37,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:36:37,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:36:37,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:37,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:37,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-10 00:36:37,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:36:37,715 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-01-10 00:36:37,744 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-01-10 00:36:37,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:36:37,862 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-01-10 00:36:37,889 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-01-10 00:36:37,948 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-01-10 00:36:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:38,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:37:00,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse3 .cse2)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* 4 (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int)) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* 4 (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))))) is different from false [2025-01-10 00:37:26,410 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2025-01-10 00:37:26,411 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 116 treesize of output 146 [2025-01-10 00:37:26,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:26,434 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 111 treesize of output 111 [2025-01-10 00:37:26,509 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-01-10 00:37:26,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:26,529 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 50 [2025-01-10 00:37:26,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:26,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:26,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:26,633 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 42 treesize of output 47 [2025-01-10 00:37:26,641 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 34 treesize of output 30 [2025-01-10 00:37:26,645 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:37:26,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:26,651 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 23 treesize of output 15 [2025-01-10 00:37:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-10 00:37:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875526623] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:37:26,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:37:26,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 29 [2025-01-10 00:37:26,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070395842] [2025-01-10 00:37:26,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:37:26,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-10 00:37:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:26,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-10 00:37:26,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=727, Unknown=5, NotChecked=56, Total=930 [2025-01-10 00:37:27,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 172 [2025-01-10 00:37:27,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 124 transitions, 419 flow. Second operand has 31 states, 31 states have (on average 37.0) internal successors, (1147), 31 states have internal predecessors, (1147), 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-01-10 00:37:27,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:27,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 172 [2025-01-10 00:37:27,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:31,671 INFO L124 PetriNetUnfolderBase]: 6925/12298 cut-off events. [2025-01-10 00:37:31,671 INFO L125 PetriNetUnfolderBase]: For 3209/3209 co-relation queries the response was YES. [2025-01-10 00:37:31,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27619 conditions, 12298 events. 6925/12298 cut-off events. For 3209/3209 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 78430 event pairs, 957 based on Foata normal form. 98/11241 useless extension candidates. Maximal degree in co-relation 27604. Up to 6761 conditions per place. [2025-01-10 00:37:31,711 INFO L140 encePairwiseOnDemand]: 153/172 looper letters, 338 selfloop transitions, 43 changer transitions 0/400 dead transitions. [2025-01-10 00:37:31,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 400 transitions, 1893 flow [2025-01-10 00:37:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:37:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 00:37:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 934 transitions. [2025-01-10 00:37:31,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31942544459644323 [2025-01-10 00:37:31,714 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 419 flow. Second operand 17 states and 934 transitions. [2025-01-10 00:37:31,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 400 transitions, 1893 flow [2025-01-10 00:37:31,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 400 transitions, 1888 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:31,724 INFO L231 Difference]: Finished difference. Result has 151 places, 159 transitions, 787 flow [2025-01-10 00:37:31,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=787, PETRI_PLACES=151, PETRI_TRANSITIONS=159} [2025-01-10 00:37:31,725 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -11 predicate places. [2025-01-10 00:37:31,725 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 159 transitions, 787 flow [2025-01-10 00:37:31,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 37.0) internal successors, (1147), 31 states have internal predecessors, (1147), 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-01-10 00:37:31,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:31,726 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, 1, 1, 1, 1] [2025-01-10 00:37:31,732 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-01-10 00:37:31,930 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,SelfDestructingSolverStorable16 [2025-01-10 00:37:31,930 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:37:31,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash -892471722, now seen corresponding path program 1 times [2025-01-10 00:37:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71467330] [2025-01-10 00:37:31,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:31,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:37:31,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:37:31,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:31,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 00:37:31,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71467330] [2025-01-10 00:37:31,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71467330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:31,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:31,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196521963] [2025-01-10 00:37:31,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:31,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:31,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:31,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:31,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-01-10 00:37:31,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 159 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:31,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:31,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-01-10 00:37:31,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:33,208 INFO L124 PetriNetUnfolderBase]: 6337/14534 cut-off events. [2025-01-10 00:37:33,208 INFO L125 PetriNetUnfolderBase]: For 9281/9423 co-relation queries the response was YES. [2025-01-10 00:37:33,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31827 conditions, 14534 events. 6337/14534 cut-off events. For 9281/9423 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 124288 event pairs, 3063 based on Foata normal form. 276/12915 useless extension candidates. Maximal degree in co-relation 31803. Up to 5981 conditions per place. [2025-01-10 00:37:33,286 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 174 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2025-01-10 00:37:33,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 242 transitions, 1608 flow [2025-01-10 00:37:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2025-01-10 00:37:33,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7965116279069767 [2025-01-10 00:37:33,287 INFO L175 Difference]: Start difference. First operand has 151 places, 159 transitions, 787 flow. Second operand 3 states and 411 transitions. [2025-01-10 00:37:33,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 242 transitions, 1608 flow [2025-01-10 00:37:33,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 242 transitions, 1522 flow, removed 33 selfloop flow, removed 5 redundant places. [2025-01-10 00:37:33,308 INFO L231 Difference]: Finished difference. Result has 149 places, 160 transitions, 734 flow [2025-01-10 00:37:33,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=149, PETRI_TRANSITIONS=160} [2025-01-10 00:37:33,309 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -13 predicate places. [2025-01-10 00:37:33,309 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 160 transitions, 734 flow [2025-01-10 00:37:33,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:33,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:33,309 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, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:33,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:37:33,309 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:37:33,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash -480455259, now seen corresponding path program 1 times [2025-01-10 00:37:33,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:33,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835255826] [2025-01-10 00:37:33,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:33,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:37:33,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:37:33,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:33,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 00:37:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:33,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835255826] [2025-01-10 00:37:33,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835255826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:33,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:33,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:33,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459367551] [2025-01-10 00:37:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:33,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:33,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:33,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:33,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-01-10 00:37:33,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 160 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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-01-10 00:37:33,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:33,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-01-10 00:37:33,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:35,073 INFO L124 PetriNetUnfolderBase]: 7857/15576 cut-off events. [2025-01-10 00:37:35,074 INFO L125 PetriNetUnfolderBase]: For 10509/10603 co-relation queries the response was YES. [2025-01-10 00:37:35,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37930 conditions, 15576 events. 7857/15576 cut-off events. For 10509/10603 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 120250 event pairs, 4553 based on Foata normal form. 116/14544 useless extension candidates. Maximal degree in co-relation 37904. Up to 10714 conditions per place. [2025-01-10 00:37:35,168 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 130 selfloop transitions, 3 changer transitions 0/198 dead transitions. [2025-01-10 00:37:35,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 198 transitions, 1172 flow [2025-01-10 00:37:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2025-01-10 00:37:35,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7151162790697675 [2025-01-10 00:37:35,170 INFO L175 Difference]: Start difference. First operand has 149 places, 160 transitions, 734 flow. Second operand 4 states and 492 transitions. [2025-01-10 00:37:35,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 198 transitions, 1172 flow [2025-01-10 00:37:35,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 198 transitions, 1168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:35,209 INFO L231 Difference]: Finished difference. Result has 152 places, 161 transitions, 748 flow [2025-01-10 00:37:35,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=748, PETRI_PLACES=152, PETRI_TRANSITIONS=161} [2025-01-10 00:37:35,210 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -10 predicate places. [2025-01-10 00:37:35,210 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 161 transitions, 748 flow [2025-01-10 00:37:35,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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-01-10 00:37:35,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:35,210 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:35,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:37:35,211 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:37:35,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash -339019330, now seen corresponding path program 1 times [2025-01-10 00:37:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:35,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227335667] [2025-01-10 00:37:35,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:35,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:35,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 00:37:35,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 00:37:35,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:35,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:37:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227335667] [2025-01-10 00:37:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227335667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:35,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:35,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345060996] [2025-01-10 00:37:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:35,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:35,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:35,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:35,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-01-10 00:37:35,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 161 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:35,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:35,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-01-10 00:37:35,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:36,017 INFO L124 PetriNetUnfolderBase]: 3448/7660 cut-off events. [2025-01-10 00:37:36,017 INFO L125 PetriNetUnfolderBase]: For 4572/4578 co-relation queries the response was YES. [2025-01-10 00:37:36,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17257 conditions, 7660 events. 3448/7660 cut-off events. For 4572/4578 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 54584 event pairs, 1673 based on Foata normal form. 188/7115 useless extension candidates. Maximal degree in co-relation 17230. Up to 3127 conditions per place. [2025-01-10 00:37:36,051 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 91 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2025-01-10 00:37:36,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 142 transitions, 757 flow [2025-01-10 00:37:36,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-01-10 00:37:36,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7306201550387597 [2025-01-10 00:37:36,052 INFO L175 Difference]: Start difference. First operand has 152 places, 161 transitions, 748 flow. Second operand 3 states and 377 transitions. [2025-01-10 00:37:36,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 142 transitions, 757 flow [2025-01-10 00:37:36,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 704 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-01-10 00:37:36,061 INFO L231 Difference]: Finished difference. Result has 141 places, 126 transitions, 487 flow [2025-01-10 00:37:36,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=141, PETRI_TRANSITIONS=126} [2025-01-10 00:37:36,061 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -21 predicate places. [2025-01-10 00:37:36,062 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 126 transitions, 487 flow [2025-01-10 00:37:36,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:36,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:36,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:36,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:37:36,062 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:37:36,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:36,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1582200675, now seen corresponding path program 1 times [2025-01-10 00:37:36,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:36,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539886555] [2025-01-10 00:37:36,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:36,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:36,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:37:36,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:37:36,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:36,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:37:36,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:36,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539886555] [2025-01-10 00:37:36,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539886555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:36,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791006119] [2025-01-10 00:37:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:36,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:36,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:36,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:36,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-01-10 00:37:36,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 126 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-01-10 00:37:36,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:36,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-01-10 00:37:36,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:36,589 INFO L124 PetriNetUnfolderBase]: 2158/5366 cut-off events. [2025-01-10 00:37:36,590 INFO L125 PetriNetUnfolderBase]: For 2284/2284 co-relation queries the response was YES. [2025-01-10 00:37:36,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12101 conditions, 5366 events. 2158/5366 cut-off events. For 2284/2284 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 35629 event pairs, 547 based on Foata normal form. 312/5194 useless extension candidates. Maximal degree in co-relation 12079. Up to 2577 conditions per place. [2025-01-10 00:37:36,615 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 83 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-01-10 00:37:36,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 139 transitions, 709 flow [2025-01-10 00:37:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-01-10 00:37:36,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7306201550387597 [2025-01-10 00:37:36,616 INFO L175 Difference]: Start difference. First operand has 141 places, 126 transitions, 487 flow. Second operand 3 states and 377 transitions. [2025-01-10 00:37:36,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 139 transitions, 709 flow [2025-01-10 00:37:36,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 699 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:36,624 INFO L231 Difference]: Finished difference. Result has 140 places, 126 transitions, 489 flow [2025-01-10 00:37:36,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=489, PETRI_PLACES=140, PETRI_TRANSITIONS=126} [2025-01-10 00:37:36,624 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -22 predicate places. [2025-01-10 00:37:36,624 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 126 transitions, 489 flow [2025-01-10 00:37:36,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-01-10 00:37:36,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:36,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:36,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:37:36,625 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:37:36,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash -155961067, now seen corresponding path program 1 times [2025-01-10 00:37:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780544798] [2025-01-10 00:37:36,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:36,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 00:37:36,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 00:37:36,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:36,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:37:36,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:36,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780544798] [2025-01-10 00:37:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780544798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:36,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022076163] [2025-01-10 00:37:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:36,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:36,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:36,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:36,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:36,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 172 [2025-01-10 00:37:36,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 126 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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-01-10 00:37:36,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:36,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 172 [2025-01-10 00:37:36,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:37,287 INFO L124 PetriNetUnfolderBase]: 2158/4992 cut-off events. [2025-01-10 00:37:37,287 INFO L125 PetriNetUnfolderBase]: For 2531/2533 co-relation queries the response was YES. [2025-01-10 00:37:37,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12145 conditions, 4992 events. 2158/4992 cut-off events. For 2531/2533 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 31381 event pairs, 1492 based on Foata normal form. 156/4910 useless extension candidates. Maximal degree in co-relation 12124. Up to 3199 conditions per place. [2025-01-10 00:37:37,310 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 78 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2025-01-10 00:37:37,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 123 transitions, 652 flow [2025-01-10 00:37:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2025-01-10 00:37:37,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6468023255813954 [2025-01-10 00:37:37,311 INFO L175 Difference]: Start difference. First operand has 140 places, 126 transitions, 489 flow. Second operand 4 states and 445 transitions. [2025-01-10 00:37:37,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 123 transitions, 652 flow [2025-01-10 00:37:37,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 123 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:37,317 INFO L231 Difference]: Finished difference. Result has 134 places, 118 transitions, 473 flow [2025-01-10 00:37:37,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=473, PETRI_PLACES=134, PETRI_TRANSITIONS=118} [2025-01-10 00:37:37,318 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -28 predicate places. [2025-01-10 00:37:37,318 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 118 transitions, 473 flow [2025-01-10 00:37:37,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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-01-10 00:37:37,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:37,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:37,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:37:37,318 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:37:37,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1137864866, now seen corresponding path program 1 times [2025-01-10 00:37:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902683918] [2025-01-10 00:37:37,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:37,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 00:37:37,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 00:37:37,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:37,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:37:37,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:37,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902683918] [2025-01-10 00:37:37,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902683918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:37,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:37,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:37,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203977965] [2025-01-10 00:37:37,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:37,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:37,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:37,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:37,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:37,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 172 [2025-01-10 00:37:37,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 118 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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-01-10 00:37:37,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:37,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 172 [2025-01-10 00:37:37,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:38,028 INFO L124 PetriNetUnfolderBase]: 2158/4770 cut-off events. [2025-01-10 00:37:38,028 INFO L125 PetriNetUnfolderBase]: For 2440/2442 co-relation queries the response was YES. [2025-01-10 00:37:38,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11737 conditions, 4770 events. 2158/4770 cut-off events. For 2440/2442 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 28597 event pairs, 1492 based on Foata normal form. 156/4792 useless extension candidates. Maximal degree in co-relation 11715. Up to 3199 conditions per place. [2025-01-10 00:37:38,047 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 78 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-01-10 00:37:38,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 116 transitions, 638 flow [2025-01-10 00:37:38,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2025-01-10 00:37:38,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-01-10 00:37:38,048 INFO L175 Difference]: Start difference. First operand has 134 places, 118 transitions, 473 flow. Second operand 4 states and 448 transitions. [2025-01-10 00:37:38,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 116 transitions, 638 flow [2025-01-10 00:37:38,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 116 transitions, 632 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:38,054 INFO L231 Difference]: Finished difference. Result has 127 places, 111 transitions, 459 flow [2025-01-10 00:37:38,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=127, PETRI_TRANSITIONS=111} [2025-01-10 00:37:38,054 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -35 predicate places. [2025-01-10 00:37:38,054 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 111 transitions, 459 flow [2025-01-10 00:37:38,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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-01-10 00:37:38,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:38,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:38,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 00:37:38,055 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:37:38,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:38,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1035408862, now seen corresponding path program 1 times [2025-01-10 00:37:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:38,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183684613] [2025-01-10 00:37:38,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:38,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 00:37:38,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 00:37:38,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:38,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 00:37:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183684613] [2025-01-10 00:37:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183684613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:38,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792988007] [2025-01-10 00:37:38,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:38,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:38,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:38,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:38,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-01-10 00:37:38,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 111 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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-01-10 00:37:38,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:38,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-01-10 00:37:38,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:38,760 INFO L124 PetriNetUnfolderBase]: 2959/6817 cut-off events. [2025-01-10 00:37:38,760 INFO L125 PetriNetUnfolderBase]: For 3582/3587 co-relation queries the response was YES. [2025-01-10 00:37:38,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16264 conditions, 6817 events. 2959/6817 cut-off events. For 3582/3587 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 46414 event pairs, 1046 based on Foata normal form. 202/6840 useless extension candidates. Maximal degree in co-relation 16242. Up to 2626 conditions per place. [2025-01-10 00:37:38,782 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 200 selfloop transitions, 3 changer transitions 0/238 dead transitions. [2025-01-10 00:37:38,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 238 transitions, 1461 flow [2025-01-10 00:37:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2025-01-10 00:37:38,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.813953488372093 [2025-01-10 00:37:38,783 INFO L175 Difference]: Start difference. First operand has 127 places, 111 transitions, 459 flow. Second operand 4 states and 560 transitions. [2025-01-10 00:37:38,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 238 transitions, 1461 flow [2025-01-10 00:37:38,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 238 transitions, 1447 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:38,790 INFO L231 Difference]: Finished difference. Result has 128 places, 112 transitions, 469 flow [2025-01-10 00:37:38,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=469, PETRI_PLACES=128, PETRI_TRANSITIONS=112} [2025-01-10 00:37:38,790 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -34 predicate places. [2025-01-10 00:37:38,790 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 112 transitions, 469 flow [2025-01-10 00:37:38,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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-01-10 00:37:38,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:38,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:38,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 00:37:38,791 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:37:38,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1656723420, now seen corresponding path program 1 times [2025-01-10 00:37:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:38,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619952727] [2025-01-10 00:37:38,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:38,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 00:37:38,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 00:37:38,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:38,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 00:37:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619952727] [2025-01-10 00:37:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619952727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:37:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7927562] [2025-01-10 00:37:39,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:39,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:39,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:39,048 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-01-10 00:37:39,050 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-01-10 00:37:39,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 00:37:39,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 00:37:39,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:39,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:39,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 00:37:39,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:37:39,211 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 13 treesize of output 9 [2025-01-10 00:37:39,247 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 29 treesize of output 13 [2025-01-10 00:37:39,383 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:37:39,397 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-01-10 00:37:39,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2025-01-10 00:37:39,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:39,421 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 29 treesize of output 13 [2025-01-10 00:37:39,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9 treesize of output 3 [2025-01-10 00:37:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 00:37:39,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:37:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7927562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:39,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:37:39,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2025-01-10 00:37:39,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229965883] [2025-01-10 00:37:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:39,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:37:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:39,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:37:39,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:37:39,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-01-10 00:37:39,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 112 transitions, 469 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-01-10 00:37:39,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:39,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-01-10 00:37:39,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:40,444 INFO L124 PetriNetUnfolderBase]: 2598/5600 cut-off events. [2025-01-10 00:37:40,444 INFO L125 PetriNetUnfolderBase]: For 4268/4268 co-relation queries the response was YES. [2025-01-10 00:37:40,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14428 conditions, 5600 events. 2598/5600 cut-off events. For 4268/4268 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34012 event pairs, 644 based on Foata normal form. 0/5433 useless extension candidates. Maximal degree in co-relation 14405. Up to 4105 conditions per place. [2025-01-10 00:37:40,464 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 104 selfloop transitions, 8 changer transitions 0/134 dead transitions. [2025-01-10 00:37:40,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 134 transitions, 763 flow [2025-01-10 00:37:40,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:37:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:37:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions. [2025-01-10 00:37:40,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418 [2025-01-10 00:37:40,467 INFO L175 Difference]: Start difference. First operand has 128 places, 112 transitions, 469 flow. Second operand 7 states and 742 transitions. [2025-01-10 00:37:40,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 134 transitions, 763 flow [2025-01-10 00:37:40,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 134 transitions, 701 flow, removed 15 selfloop flow, removed 9 redundant places. [2025-01-10 00:37:40,471 INFO L231 Difference]: Finished difference. Result has 118 places, 100 transitions, 355 flow [2025-01-10 00:37:40,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=355, PETRI_PLACES=118, PETRI_TRANSITIONS=100} [2025-01-10 00:37:40,475 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -44 predicate places. [2025-01-10 00:37:40,475 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 100 transitions, 355 flow [2025-01-10 00:37:40,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-01-10 00:37:40,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:40,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:40,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:37:40,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:40,677 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:37:40,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash 870411210, now seen corresponding path program 1 times [2025-01-10 00:37:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129984879] [2025-01-10 00:37:40,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:40,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:37:40,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:37:40,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:40,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 00:37:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129984879] [2025-01-10 00:37:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129984879] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:37:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943300776] [2025-01-10 00:37:41,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:41,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:41,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:41,235 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-01-10 00:37:41,235 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-01-10 00:37:41,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:37:41,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:37:41,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:41,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:41,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-10 00:37:41,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:37:41,393 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 13 treesize of output 9 [2025-01-10 00:37:41,425 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 29 treesize of output 13 [2025-01-10 00:37:41,562 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:37:41,573 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-01-10 00:37:41,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2025-01-10 00:37:41,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:41,604 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 29 treesize of output 13 [2025-01-10 00:37:41,697 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 29 treesize of output 3 [2025-01-10 00:37:41,831 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-10 00:37:41,831 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 42 treesize of output 16 [2025-01-10 00:37:41,842 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 29 treesize of output 13 [2025-01-10 00:37:41,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2025-01-10 00:37:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 00:37:41,866 INFO L312 TraceCheckSpWp]: Computing backward predicates...