./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c --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/weaver/chl-node-subst.wvr.c -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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:02:57,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:02:57,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:02:57,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:02:57,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:02:57,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:02:57,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:02:57,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:02:57,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:02:57,220 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:02:57,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:02:57,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:02:57,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:02:57,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:02:57,220 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:02:57,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:02:57,221 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:02:57,222 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:02:57,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:02:57,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:02:57,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:02:57,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:02:57,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:02:57,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:02:57,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:02:57,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:02:57,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:02:57,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:02:57,223 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-01-10 01:02:57,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:02:57,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:02:57,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:02:57,460 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:02:57,460 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:02:57,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-01-10 01:02:58,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cad1161a3/83eba3a0d7b843e49a35f1f41bd0e2b7/FLAG10d3e9520 [2025-01-10 01:02:59,044 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:02:59,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-01-10 01:02:59,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cad1161a3/83eba3a0d7b843e49a35f1f41bd0e2b7/FLAG10d3e9520 [2025-01-10 01:02:59,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cad1161a3/83eba3a0d7b843e49a35f1f41bd0e2b7 [2025-01-10 01:02:59,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:02:59,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:02:59,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:02:59,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:02:59,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:02:59,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6a77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59, skipping insertion in model container [2025-01-10 01:02:59,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:02:59,184 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:02:59,187 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:02:59,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:02:59,200 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:02:59,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:02:59,252 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:02:59,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59 WrapperNode [2025-01-10 01:02:59,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:02:59,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:02:59,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:02:59,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:02:59,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,312 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 408 [2025-01-10 01:02:59,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:02:59,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:02:59,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:02:59,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:02:59,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,356 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-01-10 01:02:59,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:02:59,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:02:59,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:02:59,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:02:59,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:02:59,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:59,442 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 01:02:59,451 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 01:02:59,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:02:59,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:02:59,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:02:59,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:02:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:02:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:02:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:02:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:02:59,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:02:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:02:59,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:02:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:02:59,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:02:59,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:02:59,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:02:59,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:02:59,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:02:59,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:02:59,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:02:59,483 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 01:02:59,598 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:02:59,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:03:00,107 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:03:00,108 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:03:00,484 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:03:00,484 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:03:00,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:00 BoogieIcfgContainer [2025-01-10 01:03:00,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:03:00,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:03:00,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:03:00,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:03:00,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:02:59" (1/3) ... [2025-01-10 01:03:00,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eef3acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:00, skipping insertion in model container [2025-01-10 01:03:00,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59" (2/3) ... [2025-01-10 01:03:00,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eef3acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:00, skipping insertion in model container [2025-01-10 01:03:00,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:00" (3/3) ... [2025-01-10 01:03:00,494 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-01-10 01:03:00,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:03:00,507 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 109 locations, 1 initial locations, 6 loop locations, and 50 error locations. [2025-01-10 01:03:00,507 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:03:00,614 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:03:00,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 120 transitions, 261 flow [2025-01-10 01:03:00,695 INFO L124 PetriNetUnfolderBase]: 12/117 cut-off events. [2025-01-10 01:03:00,700 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:03:00,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 12/117 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 388 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2025-01-10 01:03:00,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 120 transitions, 261 flow [2025-01-10 01:03:00,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 116 transitions, 250 flow [2025-01-10 01:03:00,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:03:00,731 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;@4909006b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:03:00,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2025-01-10 01:03:00,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:03:00,736 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:03:00,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:03:00,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:00,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:03:00,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:00,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:00,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1282677, now seen corresponding path program 1 times [2025-01-10 01:03:00,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:00,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499282385] [2025-01-10 01:03:00,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:00,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:03:00,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:03:00,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:00,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:01,023 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 01:03:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499282385] [2025-01-10 01:03:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499282385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:01,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:03:01,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107833548] [2025-01-10 01:03:01,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:01,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:01,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:01,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:01,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:01,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:01,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 01:03:01,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:01,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:01,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:01,904 INFO L124 PetriNetUnfolderBase]: 2263/4993 cut-off events. [2025-01-10 01:03:01,904 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-01-10 01:03:01,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 4993 events. 2263/4993 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40695 event pairs, 1414 based on Foata normal form. 1/3839 useless extension candidates. Maximal degree in co-relation 7651. Up to 3012 conditions per place. [2025-01-10 01:03:01,951 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 48 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-01-10 01:03:01,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 340 flow [2025-01-10 01:03:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-01-10 01:03:01,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-01-10 01:03:01,967 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 250 flow. Second operand 3 states and 249 transitions. [2025-01-10 01:03:01,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 340 flow [2025-01-10 01:03:01,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 328 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:01,977 INFO L231 Difference]: Finished difference. Result has 105 places, 111 transitions, 232 flow [2025-01-10 01:03:01,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=105, PETRI_TRANSITIONS=111} [2025-01-10 01:03:01,982 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -9 predicate places. [2025-01-10 01:03:01,983 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 111 transitions, 232 flow [2025-01-10 01:03:01,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 01:03:01,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:01,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:03:01,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:03:01,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:01,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1282678, now seen corresponding path program 1 times [2025-01-10 01:03:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:01,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667085005] [2025-01-10 01:03:01,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:01,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:01,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:03:02,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:03:02,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:02,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:02,369 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 01:03:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:02,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667085005] [2025-01-10 01:03:02,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667085005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:02,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823953141] [2025-01-10 01:03:02,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:02,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:02,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:02,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:02,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:02,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 111 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:02,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:02,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:02,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:03,007 INFO L124 PetriNetUnfolderBase]: 2264/4996 cut-off events. [2025-01-10 01:03:03,007 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 01:03:03,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 4996 events. 2264/4996 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40750 event pairs, 1414 based on Foata normal form. 0/3838 useless extension candidates. Maximal degree in co-relation 8038. Up to 3025 conditions per place. [2025-01-10 01:03:03,042 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 53 selfloop transitions, 3 changer transitions 0/114 dead transitions. [2025-01-10 01:03:03,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 114 transitions, 350 flow [2025-01-10 01:03:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-01-10 01:03:03,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 01:03:03,045 INFO L175 Difference]: Start difference. First operand has 105 places, 111 transitions, 232 flow. Second operand 3 states and 252 transitions. [2025-01-10 01:03:03,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 114 transitions, 350 flow [2025-01-10 01:03:03,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 114 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:03,048 INFO L231 Difference]: Finished difference. Result has 106 places, 113 transitions, 247 flow [2025-01-10 01:03:03,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=106, PETRI_TRANSITIONS=113} [2025-01-10 01:03:03,049 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -8 predicate places. [2025-01-10 01:03:03,049 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 113 transitions, 247 flow [2025-01-10 01:03:03,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:03,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:03,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:03:03,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:03:03,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:03,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:03,051 INFO L85 PathProgramCache]: Analyzing trace with hash 39766320, now seen corresponding path program 1 times [2025-01-10 01:03:03,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:03,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753256335] [2025-01-10 01:03:03,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:03,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:03:03,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:03:03,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:03,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:03,166 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 01:03:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:03,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753256335] [2025-01-10 01:03:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753256335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:03,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:03,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327909921] [2025-01-10 01:03:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:03,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:03,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:03,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:03,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:03,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:03,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 113 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 01:03:03,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:03,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:03,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:03,597 INFO L124 PetriNetUnfolderBase]: 2263/4995 cut-off events. [2025-01-10 01:03:03,598 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 01:03:03,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 4995 events. 2263/4995 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40760 event pairs, 1414 based on Foata normal form. 1/3842 useless extension candidates. Maximal degree in co-relation 8062. Up to 3021 conditions per place. [2025-01-10 01:03:03,632 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 50 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-01-10 01:03:03,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 113 transitions, 348 flow [2025-01-10 01:03:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-01-10 01:03:03,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7138888888888889 [2025-01-10 01:03:03,636 INFO L175 Difference]: Start difference. First operand has 106 places, 113 transitions, 247 flow. Second operand 3 states and 257 transitions. [2025-01-10 01:03:03,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 113 transitions, 348 flow [2025-01-10 01:03:03,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 113 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:03,638 INFO L231 Difference]: Finished difference. Result has 107 places, 112 transitions, 244 flow [2025-01-10 01:03:03,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=107, PETRI_TRANSITIONS=112} [2025-01-10 01:03:03,638 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -7 predicate places. [2025-01-10 01:03:03,640 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 112 transitions, 244 flow [2025-01-10 01:03:03,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 01:03:03,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:03,641 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:03:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:03:03,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1232696546, now seen corresponding path program 1 times [2025-01-10 01:03:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:03,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440581279] [2025-01-10 01:03:03,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:03,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:03:03,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:03:03,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:03,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440581279] [2025-01-10 01:03:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440581279] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245185645] [2025-01-10 01:03:03,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:03,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:03,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:03,998 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 01:03:04,001 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 01:03:04,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:03:04,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:03:04,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:04,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:04,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:03:04,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:04,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2025-01-10 01:03:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:04,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:04,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245185645] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:04,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:04,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:03:04,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49214853] [2025-01-10 01:03:04,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:04,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:03:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:04,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:03:04,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:03:05,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:05,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 112 transitions, 244 flow. Second operand has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 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 01:03:05,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:05,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:05,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:05,777 INFO L124 PetriNetUnfolderBase]: 2263/4994 cut-off events. [2025-01-10 01:03:05,778 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 01:03:05,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8076 conditions, 4994 events. 2263/4994 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40748 event pairs, 1414 based on Foata normal form. 0/3838 useless extension candidates. Maximal degree in co-relation 8062. Up to 3020 conditions per place. [2025-01-10 01:03:05,803 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 49 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-01-10 01:03:05,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 350 flow [2025-01-10 01:03:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:03:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:03:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2025-01-10 01:03:05,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-01-10 01:03:05,805 INFO L175 Difference]: Start difference. First operand has 107 places, 112 transitions, 244 flow. Second operand 5 states and 380 transitions. [2025-01-10 01:03:05,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 350 flow [2025-01-10 01:03:05,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 112 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:05,807 INFO L231 Difference]: Finished difference. Result has 109 places, 112 transitions, 254 flow [2025-01-10 01:03:05,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=109, PETRI_TRANSITIONS=112} [2025-01-10 01:03:05,808 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -5 predicate places. [2025-01-10 01:03:05,808 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 112 transitions, 254 flow [2025-01-10 01:03:05,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 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 01:03:05,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:05,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:03:05,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:06,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:06,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:06,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:06,015 INFO L85 PathProgramCache]: Analyzing trace with hash -441109436, now seen corresponding path program 1 times [2025-01-10 01:03:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:06,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891720782] [2025-01-10 01:03:06,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:06,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:03:06,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:03:06,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:06,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:06,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:06,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891720782] [2025-01-10 01:03:06,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891720782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:06,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:06,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:06,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438140213] [2025-01-10 01:03:06,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:06,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:06,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:06,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:06,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:06,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 112 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 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 01:03:06,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:06,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:06,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:06,743 INFO L124 PetriNetUnfolderBase]: 2264/4997 cut-off events. [2025-01-10 01:03:06,744 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 01:03:06,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8089 conditions, 4997 events. 2264/4997 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40760 event pairs, 1414 based on Foata normal form. 0/3840 useless extension candidates. Maximal degree in co-relation 8060. Up to 3023 conditions per place. [2025-01-10 01:03:06,768 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 52 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-01-10 01:03:06,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 115 transitions, 374 flow [2025-01-10 01:03:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2025-01-10 01:03:06,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-01-10 01:03:06,769 INFO L175 Difference]: Start difference. First operand has 109 places, 112 transitions, 254 flow. Second operand 4 states and 318 transitions. [2025-01-10 01:03:06,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 115 transitions, 374 flow [2025-01-10 01:03:06,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 364 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:06,772 INFO L231 Difference]: Finished difference. Result has 110 places, 114 transitions, 269 flow [2025-01-10 01:03:06,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=110, PETRI_TRANSITIONS=114} [2025-01-10 01:03:06,773 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -4 predicate places. [2025-01-10 01:03:06,773 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 114 transitions, 269 flow [2025-01-10 01:03:06,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 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 01:03:06,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:06,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:06,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:03:06,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:06,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash -789488799, now seen corresponding path program 1 times [2025-01-10 01:03:06,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:06,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134172963] [2025-01-10 01:03:06,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:06,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:03:06,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:03:06,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:06,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:06,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:06,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134172963] [2025-01-10 01:03:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134172963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:06,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026654524] [2025-01-10 01:03:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:06,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:06,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:06,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:06,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:06,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 114 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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 01:03:06,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:06,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:06,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:07,220 INFO L124 PetriNetUnfolderBase]: 2263/4996 cut-off events. [2025-01-10 01:03:07,220 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 01:03:07,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8089 conditions, 4996 events. 2263/4996 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40713 event pairs, 1414 based on Foata normal form. 1/3844 useless extension candidates. Maximal degree in co-relation 8061. Up to 3020 conditions per place. [2025-01-10 01:03:07,250 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 50 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-01-10 01:03:07,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 114 transitions, 374 flow [2025-01-10 01:03:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-01-10 01:03:07,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-01-10 01:03:07,252 INFO L175 Difference]: Start difference. First operand has 110 places, 114 transitions, 269 flow. Second operand 4 states and 327 transitions. [2025-01-10 01:03:07,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 114 transitions, 374 flow [2025-01-10 01:03:07,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 114 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:07,254 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 268 flow [2025-01-10 01:03:07,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2025-01-10 01:03:07,255 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2025-01-10 01:03:07,255 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 268 flow [2025-01-10 01:03:07,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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 01:03:07,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:07,255 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:07,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:03:07,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:07,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1295636732, now seen corresponding path program 1 times [2025-01-10 01:03:07,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:07,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348746920] [2025-01-10 01:03:07,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:07,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:07,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:03:07,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:03:07,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:07,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348746920] [2025-01-10 01:03:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348746920] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147768486] [2025-01-10 01:03:07,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:07,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:07,510 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 01:03:07,512 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 01:03:07,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:03:07,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:03:07,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:07,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:07,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:03:07,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:07,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2025-01-10 01:03:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:07,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147768486] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:07,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:07,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:03:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361366059] [2025-01-10 01:03:07,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:07,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:03:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:07,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:03:07,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:03:08,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:08,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 268 flow. Second operand has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 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 01:03:08,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:08,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:08,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:09,389 INFO L124 PetriNetUnfolderBase]: 2263/4995 cut-off events. [2025-01-10 01:03:09,390 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 01:03:09,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8090 conditions, 4995 events. 2263/4995 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40749 event pairs, 1414 based on Foata normal form. 0/3841 useless extension candidates. Maximal degree in co-relation 8060. Up to 3015 conditions per place. [2025-01-10 01:03:09,421 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 45 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2025-01-10 01:03:09,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 376 flow [2025-01-10 01:03:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 511 transitions. [2025-01-10 01:03:09,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2025-01-10 01:03:09,425 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 268 flow. Second operand 7 states and 511 transitions. [2025-01-10 01:03:09,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 376 flow [2025-01-10 01:03:09,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 368 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:09,429 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 278 flow [2025-01-10 01:03:09,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2025-01-10 01:03:09,430 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2025-01-10 01:03:09,430 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 278 flow [2025-01-10 01:03:09,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 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 01:03:09,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:09,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:09,439 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 01:03:09,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:09,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:09,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1510034857, now seen corresponding path program 1 times [2025-01-10 01:03:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:09,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131469993] [2025-01-10 01:03:09,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:09,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:09,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:03:09,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:03:09,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:09,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:09,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:09,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131469993] [2025-01-10 01:03:09,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131469993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:09,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:09,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:09,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755418169] [2025-01-10 01:03:09,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:09,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:09,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:09,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:09,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:09,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:09,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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 01:03:09,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:09,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:09,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:10,297 INFO L124 PetriNetUnfolderBase]: 2264/4998 cut-off events. [2025-01-10 01:03:10,298 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-10 01:03:10,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8102 conditions, 4998 events. 2264/4998 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40725 event pairs, 1414 based on Foata normal form. 0/3843 useless extension candidates. Maximal degree in co-relation 8070. Up to 3024 conditions per place. [2025-01-10 01:03:10,328 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 53 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2025-01-10 01:03:10,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 400 flow [2025-01-10 01:03:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-01-10 01:03:10,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-01-10 01:03:10,331 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 278 flow. Second operand 4 states and 317 transitions. [2025-01-10 01:03:10,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 400 flow [2025-01-10 01:03:10,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 116 transitions, 387 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:10,334 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 290 flow [2025-01-10 01:03:10,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2025-01-10 01:03:10,335 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2025-01-10 01:03:10,336 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 290 flow [2025-01-10 01:03:10,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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 01:03:10,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:10,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:10,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:03:10,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -433556229, now seen corresponding path program 1 times [2025-01-10 01:03:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:10,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381874274] [2025-01-10 01:03:10,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:10,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:03:10,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:03:10,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:10,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:10,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:10,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381874274] [2025-01-10 01:03:10,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381874274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:10,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:10,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:10,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360404490] [2025-01-10 01:03:10,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:10,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:10,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:10,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:10,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:10,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:10,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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 01:03:10,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:10,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:10,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:10,753 INFO L124 PetriNetUnfolderBase]: 2263/4997 cut-off events. [2025-01-10 01:03:10,754 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 01:03:10,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8102 conditions, 4997 events. 2263/4997 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40720 event pairs, 1414 based on Foata normal form. 1/3845 useless extension candidates. Maximal degree in co-relation 8070. Up to 3022 conditions per place. [2025-01-10 01:03:10,781 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 52 selfloop transitions, 4 changer transitions 0/115 dead transitions. [2025-01-10 01:03:10,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 399 flow [2025-01-10 01:03:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-01-10 01:03:10,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-01-10 01:03:10,782 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 290 flow. Second operand 4 states and 327 transitions. [2025-01-10 01:03:10,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 399 flow [2025-01-10 01:03:10,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:10,785 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 289 flow [2025-01-10 01:03:10,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2025-01-10 01:03:10,786 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2025-01-10 01:03:10,786 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 289 flow [2025-01-10 01:03:10,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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 01:03:10,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:10,787 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:10,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:03:10,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:10,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:10,787 INFO L85 PathProgramCache]: Analyzing trace with hash -555405784, now seen corresponding path program 1 times [2025-01-10 01:03:10,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:10,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648027179] [2025-01-10 01:03:10,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:10,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:10,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:03:10,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:03:10,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:10,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:11,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648027179] [2025-01-10 01:03:11,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648027179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455457746] [2025-01-10 01:03:11,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:11,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:11,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:11,099 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 01:03:11,102 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 01:03:11,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:03:11,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:03:11,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:11,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:11,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:03:11,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:11,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2025-01-10 01:03:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:11,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455457746] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:11,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:11,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:03:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760165016] [2025-01-10 01:03:11,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:11,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:03:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:11,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:03:11,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:03:12,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:12,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 289 flow. Second operand has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 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 01:03:12,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:12,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:12,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:12,911 INFO L124 PetriNetUnfolderBase]: 2263/4996 cut-off events. [2025-01-10 01:03:12,911 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-10 01:03:12,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8102 conditions, 4996 events. 2263/4996 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40717 event pairs, 1414 based on Foata normal form. 0/3843 useless extension candidates. Maximal degree in co-relation 8069. Up to 3016 conditions per place. [2025-01-10 01:03:12,933 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 45 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2025-01-10 01:03:12,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 114 transitions, 399 flow [2025-01-10 01:03:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 510 transitions. [2025-01-10 01:03:12,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-01-10 01:03:12,935 INFO L175 Difference]: Start difference. First operand has 115 places, 114 transitions, 289 flow. Second operand 7 states and 510 transitions. [2025-01-10 01:03:12,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 114 transitions, 399 flow [2025-01-10 01:03:12,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 391 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:12,939 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 301 flow [2025-01-10 01:03:12,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2025-01-10 01:03:12,941 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 3 predicate places. [2025-01-10 01:03:12,941 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 301 flow [2025-01-10 01:03:12,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 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 01:03:12,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:12,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:12,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:13,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:13,144 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:13,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -37706660, now seen corresponding path program 1 times [2025-01-10 01:03:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121616119] [2025-01-10 01:03:13,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:13,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:13,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:03:13,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:03:13,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:13,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:13,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:13,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121616119] [2025-01-10 01:03:13,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121616119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:13,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315950760] [2025-01-10 01:03:13,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:13,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:13,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:13,345 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:13,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:03:13,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:03:13,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:03:13,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:13,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:13,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:03:13,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:13,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-01-10 01:03:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:13,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:13,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315950760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:13,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:13,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:03:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172253660] [2025-01-10 01:03:13,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:13,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:13,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:13,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:13,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:03:13,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:13,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 301 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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 01:03:13,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:13,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:13,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:13,840 INFO L124 PetriNetUnfolderBase]: 2264/5000 cut-off events. [2025-01-10 01:03:13,840 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-10 01:03:13,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8119 conditions, 5000 events. 2264/5000 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40720 event pairs, 1414 based on Foata normal form. 0/3846 useless extension candidates. Maximal degree in co-relation 8083. Up to 3030 conditions per place. [2025-01-10 01:03:13,876 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 58 selfloop transitions, 4 changer transitions 0/117 dead transitions. [2025-01-10 01:03:13,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 117 transitions, 431 flow [2025-01-10 01:03:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-01-10 01:03:13,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-01-10 01:03:13,878 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 301 flow. Second operand 4 states and 317 transitions. [2025-01-10 01:03:13,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 117 transitions, 431 flow [2025-01-10 01:03:13,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 415 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:13,880 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 306 flow [2025-01-10 01:03:13,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2025-01-10 01:03:13,881 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 3 predicate places. [2025-01-10 01:03:13,881 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 306 flow [2025-01-10 01:03:13,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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 01:03:13,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:13,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:13,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:14,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:03:14,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:14,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -37706661, now seen corresponding path program 1 times [2025-01-10 01:03:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:14,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419398744] [2025-01-10 01:03:14,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:14,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:03:14,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:03:14,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:14,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:14,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419398744] [2025-01-10 01:03:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419398744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:14,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:14,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:14,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529296375] [2025-01-10 01:03:14,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:14,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:14,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:14,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:14,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:14,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 01:03:14,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:14,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:14,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:14,493 INFO L124 PetriNetUnfolderBase]: 2264/4996 cut-off events. [2025-01-10 01:03:14,494 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 01:03:14,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8113 conditions, 4996 events. 2264/4996 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40708 event pairs, 1414 based on Foata normal form. 2/3848 useless extension candidates. Maximal degree in co-relation 8079. Up to 3018 conditions per place. [2025-01-10 01:03:14,522 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 56 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-01-10 01:03:14,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 416 flow [2025-01-10 01:03:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-01-10 01:03:14,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2025-01-10 01:03:14,524 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 306 flow. Second operand 3 states and 248 transitions. [2025-01-10 01:03:14,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 416 flow [2025-01-10 01:03:14,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:14,526 INFO L231 Difference]: Finished difference. Result has 114 places, 113 transitions, 299 flow [2025-01-10 01:03:14,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=114, PETRI_TRANSITIONS=113} [2025-01-10 01:03:14,528 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2025-01-10 01:03:14,528 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 113 transitions, 299 flow [2025-01-10 01:03:14,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 01:03:14,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:14,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:14,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:03:14,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:14,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1168905307, now seen corresponding path program 1 times [2025-01-10 01:03:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:14,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441708352] [2025-01-10 01:03:14,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:14,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:14,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:03:14,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:03:14,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:14,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:14,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:14,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441708352] [2025-01-10 01:03:14,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441708352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:14,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:14,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169196676] [2025-01-10 01:03:14,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:14,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:14,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:14,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:14,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:14,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 113 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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 01:03:14,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:14,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:14,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:15,055 INFO L124 PetriNetUnfolderBase]: 2263/4995 cut-off events. [2025-01-10 01:03:15,056 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 01:03:15,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8109 conditions, 4995 events. 2263/4995 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40722 event pairs, 1414 based on Foata normal form. 1/3847 useless extension candidates. Maximal degree in co-relation 8076. Up to 3026 conditions per place. [2025-01-10 01:03:15,077 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 55 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-01-10 01:03:15,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 413 flow [2025-01-10 01:03:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-01-10 01:03:15,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-01-10 01:03:15,078 INFO L175 Difference]: Start difference. First operand has 114 places, 113 transitions, 299 flow. Second operand 4 states and 325 transitions. [2025-01-10 01:03:15,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 413 flow [2025-01-10 01:03:15,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 113 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:15,080 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 297 flow [2025-01-10 01:03:15,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-01-10 01:03:15,080 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2025-01-10 01:03:15,080 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 297 flow [2025-01-10 01:03:15,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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 01:03:15,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:15,081 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:15,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:03:15,081 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:15,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:15,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1876318070, now seen corresponding path program 1 times [2025-01-10 01:03:15,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:15,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068242497] [2025-01-10 01:03:15,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:15,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:15,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:03:15,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:03:15,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:15,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068242497] [2025-01-10 01:03:15,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068242497] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520131642] [2025-01-10 01:03:15,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:15,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:15,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:15,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:03:15,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:03:15,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:03:15,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:15,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:15,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:15,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:15,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520131642] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:15,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:15,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:03:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894247717] [2025-01-10 01:03:15,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:15,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:15,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:15,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:15,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:15,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:15,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 297 flow. Second operand has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 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 01:03:15,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:15,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:15,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:16,337 INFO L124 PetriNetUnfolderBase]: 4456/9776 cut-off events. [2025-01-10 01:03:16,337 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 01:03:16,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15904 conditions, 9776 events. 4456/9776 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 89133 event pairs, 2808 based on Foata normal form. 1/7617 useless extension candidates. Maximal degree in co-relation 8069. Up to 3012 conditions per place. [2025-01-10 01:03:16,402 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 86 selfloop transitions, 24 changer transitions 0/165 dead transitions. [2025-01-10 01:03:16,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 165 transitions, 678 flow [2025-01-10 01:03:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:03:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:03:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 716 transitions. [2025-01-10 01:03:16,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2025-01-10 01:03:16,408 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 297 flow. Second operand 9 states and 716 transitions. [2025-01-10 01:03:16,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 165 transitions, 678 flow [2025-01-10 01:03:16,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 165 transitions, 668 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:16,411 INFO L231 Difference]: Finished difference. Result has 125 places, 127 transitions, 460 flow [2025-01-10 01:03:16,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=125, PETRI_TRANSITIONS=127} [2025-01-10 01:03:16,412 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 11 predicate places. [2025-01-10 01:03:16,412 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 127 transitions, 460 flow [2025-01-10 01:03:16,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 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 01:03:16,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:16,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:16,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:03:16,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:03:16,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:16,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1963683127, now seen corresponding path program 1 times [2025-01-10 01:03:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:16,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097431774] [2025-01-10 01:03:16,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:16,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:16,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:03:16,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:16,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:16,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:16,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097431774] [2025-01-10 01:03:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097431774] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433122836] [2025-01-10 01:03:16,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:16,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:16,901 INFO L229 MonitoredProcess]: Starting monitored process 7 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 01:03:16,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:03:16,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:03:16,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:16,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:16,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:16,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:03:16,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:17,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-01-10 01:03:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:03:17,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433122836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:17,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:17,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-01-10 01:03:17,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300183261] [2025-01-10 01:03:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:17,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:17,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:17,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:03:17,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:17,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 127 transitions, 460 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:17,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:17,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:17,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:17,840 INFO L124 PetriNetUnfolderBase]: 4526/9990 cut-off events. [2025-01-10 01:03:17,841 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-01-10 01:03:17,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16259 conditions, 9990 events. 4526/9990 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91554 event pairs, 2828 based on Foata normal form. 0/7686 useless extension candidates. Maximal degree in co-relation 8101. Up to 6058 conditions per place. [2025-01-10 01:03:17,932 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 73 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-01-10 01:03:17,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 130 transitions, 622 flow [2025-01-10 01:03:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-01-10 01:03:17,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-01-10 01:03:17,933 INFO L175 Difference]: Start difference. First operand has 125 places, 127 transitions, 460 flow. Second operand 4 states and 317 transitions. [2025-01-10 01:03:17,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 130 transitions, 622 flow [2025-01-10 01:03:17,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 618 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:17,937 INFO L231 Difference]: Finished difference. Result has 128 places, 129 transitions, 480 flow [2025-01-10 01:03:17,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=480, PETRI_PLACES=128, PETRI_TRANSITIONS=129} [2025-01-10 01:03:17,938 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 14 predicate places. [2025-01-10 01:03:17,938 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 129 transitions, 480 flow [2025-01-10 01:03:17,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:17,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:17,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:17,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:03:18,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:03:18,143 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:18,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:18,144 INFO L85 PathProgramCache]: Analyzing trace with hash 744636382, now seen corresponding path program 1 times [2025-01-10 01:03:18,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:18,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190048763] [2025-01-10 01:03:18,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:18,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:18,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:03:18,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:18,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:18,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:18,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:18,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190048763] [2025-01-10 01:03:18,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190048763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:18,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836549119] [2025-01-10 01:03:18,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:18,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:18,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:18,282 INFO L229 MonitoredProcess]: Starting monitored process 8 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 01:03:18,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:03:18,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:03:18,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:18,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:18,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:18,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:03:18,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:03:18,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836549119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:18,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-10 01:03:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782941391] [2025-01-10 01:03:18,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:18,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:18,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:18,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:18,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:03:18,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:18,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 129 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 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 01:03:18,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:18,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:18,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:19,060 INFO L124 PetriNetUnfolderBase]: 4524/9988 cut-off events. [2025-01-10 01:03:19,060 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-01-10 01:03:19,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16263 conditions, 9988 events. 4524/9988 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91540 event pairs, 2828 based on Foata normal form. 2/7695 useless extension candidates. Maximal degree in co-relation 8102. Up to 6051 conditions per place. [2025-01-10 01:03:19,128 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 70 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2025-01-10 01:03:19,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 129 transitions, 625 flow [2025-01-10 01:03:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-01-10 01:03:19,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-01-10 01:03:19,130 INFO L175 Difference]: Start difference. First operand has 128 places, 129 transitions, 480 flow. Second operand 4 states and 325 transitions. [2025-01-10 01:03:19,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 129 transitions, 625 flow [2025-01-10 01:03:19,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 129 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:19,133 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 478 flow [2025-01-10 01:03:19,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2025-01-10 01:03:19,134 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 15 predicate places. [2025-01-10 01:03:19,134 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 478 flow [2025-01-10 01:03:19,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 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 01:03:19,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:19,135 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:19,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:19,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:19,339 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:19,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash -124499298, now seen corresponding path program 2 times [2025-01-10 01:03:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:19,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716913410] [2025-01-10 01:03:19,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:19,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:03:19,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:19,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:19,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:19,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716913410] [2025-01-10 01:03:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716913410] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703016603] [2025-01-10 01:03:19,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:19,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:19,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:19,520 INFO L229 MonitoredProcess]: Starting monitored process 9 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 01:03:19,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:03:19,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:03:19,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:19,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:19,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:19,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:03:19,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:19,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-01-10 01:03:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:19,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703016603] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:19,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 12 [2025-01-10 01:03:19,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825378744] [2025-01-10 01:03:19,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:19,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:19,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:19,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:20,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:20,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 478 flow. Second operand has 14 states, 14 states have (on average 67.57142857142857) internal successors, (946), 14 states have internal predecessors, (946), 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 01:03:20,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:20,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:20,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:21,209 INFO L124 PetriNetUnfolderBase]: 4524/9987 cut-off events. [2025-01-10 01:03:21,209 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-01-10 01:03:21,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16267 conditions, 9987 events. 4524/9987 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91533 event pairs, 2828 based on Foata normal form. 0/7688 useless extension candidates. Maximal degree in co-relation 8103. Up to 6041 conditions per place. [2025-01-10 01:03:21,256 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 57 selfloop transitions, 19 changer transitions 0/128 dead transitions. [2025-01-10 01:03:21,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 128 transitions, 630 flow [2025-01-10 01:03:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:03:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:03:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 581 transitions. [2025-01-10 01:03:21,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6052083333333333 [2025-01-10 01:03:21,258 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 478 flow. Second operand 8 states and 581 transitions. [2025-01-10 01:03:21,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 128 transitions, 630 flow [2025-01-10 01:03:21,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 128 transitions, 622 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:21,260 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 508 flow [2025-01-10 01:03:21,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=508, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2025-01-10 01:03:21,266 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 18 predicate places. [2025-01-10 01:03:21,266 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 508 flow [2025-01-10 01:03:21,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 67.57142857142857) internal successors, (946), 14 states have internal predecessors, (946), 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 01:03:21,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:21,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:21,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:21,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:03:21,470 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:21,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1608884207, now seen corresponding path program 1 times [2025-01-10 01:03:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:21,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029030750] [2025-01-10 01:03:21,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:21,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:03:21,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:03:21,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:21,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:21,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:21,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029030750] [2025-01-10 01:03:21,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029030750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:21,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089213965] [2025-01-10 01:03:21,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:21,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:21,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:21,579 INFO L229 MonitoredProcess]: Starting monitored process 10 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 01:03:21,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:03:21,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:03:21,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:03:21,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:21,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:21,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:21,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:21,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089213965] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:21,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:21,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-10 01:03:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664574616] [2025-01-10 01:03:21,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:21,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:21,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:21,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:21,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:21,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 508 flow. Second operand has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 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 01:03:21,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:21,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:21,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:23,408 INFO L124 PetriNetUnfolderBase]: 8907/19539 cut-off events. [2025-01-10 01:03:23,408 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-01-10 01:03:23,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31874 conditions, 19539 events. 8907/19539 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 198665 event pairs, 5616 based on Foata normal form. 2/15233 useless extension candidates. Maximal degree in co-relation 15909. Up to 6022 conditions per place. [2025-01-10 01:03:23,536 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 98 selfloop transitions, 36 changer transitions 0/188 dead transitions. [2025-01-10 01:03:23,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 188 transitions, 1042 flow [2025-01-10 01:03:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:03:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:03:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2025-01-10 01:03:23,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6601851851851852 [2025-01-10 01:03:23,539 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 508 flow. Second operand 9 states and 713 transitions. [2025-01-10 01:03:23,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 188 transitions, 1042 flow [2025-01-10 01:03:23,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 188 transitions, 950 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 01:03:23,543 INFO L231 Difference]: Finished difference. Result has 138 places, 146 transitions, 712 flow [2025-01-10 01:03:23,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=712, PETRI_PLACES=138, PETRI_TRANSITIONS=146} [2025-01-10 01:03:23,544 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 24 predicate places. [2025-01-10 01:03:23,544 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 146 transitions, 712 flow [2025-01-10 01:03:23,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 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 01:03:23,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:23,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:23,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:23,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:03:23,746 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:23,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1664195546, now seen corresponding path program 1 times [2025-01-10 01:03:23,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:23,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428962695] [2025-01-10 01:03:23,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:23,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:23,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:03:23,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:03:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:23,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:23,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428962695] [2025-01-10 01:03:23,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428962695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:23,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:23,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:23,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820162384] [2025-01-10 01:03:23,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:23,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:23,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:23,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:23,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:23,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:23,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 146 transitions, 712 flow. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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 01:03:23,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:23,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:23,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:25,426 INFO L124 PetriNetUnfolderBase]: 9043/19963 cut-off events. [2025-01-10 01:03:25,426 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-01-10 01:03:25,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32508 conditions, 19963 events. 9043/19963 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 203852 event pairs, 5656 based on Foata normal form. 0/15369 useless extension candidates. Maximal degree in co-relation 16216. Up to 12099 conditions per place. [2025-01-10 01:03:25,567 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 92 selfloop transitions, 4 changer transitions 0/148 dead transitions. [2025-01-10 01:03:25,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 148 transitions, 908 flow [2025-01-10 01:03:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-01-10 01:03:25,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-01-10 01:03:25,569 INFO L175 Difference]: Start difference. First operand has 138 places, 146 transitions, 712 flow. Second operand 4 states and 316 transitions. [2025-01-10 01:03:25,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 148 transitions, 908 flow [2025-01-10 01:03:25,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 148 transitions, 906 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 01:03:25,575 INFO L231 Difference]: Finished difference. Result has 142 places, 147 transitions, 729 flow [2025-01-10 01:03:25,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=729, PETRI_PLACES=142, PETRI_TRANSITIONS=147} [2025-01-10 01:03:25,577 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 28 predicate places. [2025-01-10 01:03:25,577 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 147 transitions, 729 flow [2025-01-10 01:03:25,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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 01:03:25,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:25,578 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:25,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:03:25,578 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:25,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash 864114743, now seen corresponding path program 2 times [2025-01-10 01:03:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:25,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649671834] [2025-01-10 01:03:25,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:25,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:03:25,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:03:25,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:25,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649671834] [2025-01-10 01:03:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649671834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902592701] [2025-01-10 01:03:25,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:25,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:25,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:25,843 INFO L229 MonitoredProcess]: Starting monitored process 11 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 01:03:25,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:03:25,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:03:25,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:03:25,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:25,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:25,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 01:03:25,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:26,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-10 01:03:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:26,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:26,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902592701] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:26,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-01-10 01:03:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148610066] [2025-01-10 01:03:26,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:26,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:03:26,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:26,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:03:26,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:03:27,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:27,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 147 transitions, 729 flow. Second operand has 21 states, 21 states have (on average 67.0952380952381) internal successors, (1409), 21 states have internal predecessors, (1409), 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 01:03:27,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:27,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:27,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:29,537 INFO L124 PetriNetUnfolderBase]: 13432/29535 cut-off events. [2025-01-10 01:03:29,537 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-01-10 01:03:29,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48213 conditions, 29535 events. 13432/29535 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 318022 event pairs, 8444 based on Foata normal form. 0/22931 useless extension candidates. Maximal degree in co-relation 24068. Up to 12070 conditions per place. [2025-01-10 01:03:29,742 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 133 selfloop transitions, 33 changer transitions 0/218 dead transitions. [2025-01-10 01:03:29,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 218 transitions, 1399 flow [2025-01-10 01:03:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:03:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:03:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1157 transitions. [2025-01-10 01:03:29,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6026041666666667 [2025-01-10 01:03:29,746 INFO L175 Difference]: Start difference. First operand has 142 places, 147 transitions, 729 flow. Second operand 16 states and 1157 transitions. [2025-01-10 01:03:29,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 218 transitions, 1399 flow [2025-01-10 01:03:29,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 218 transitions, 1390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:29,751 INFO L231 Difference]: Finished difference. Result has 159 places, 165 transitions, 943 flow [2025-01-10 01:03:29,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=943, PETRI_PLACES=159, PETRI_TRANSITIONS=165} [2025-01-10 01:03:29,751 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 45 predicate places. [2025-01-10 01:03:29,752 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 165 transitions, 943 flow [2025-01-10 01:03:29,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 67.0952380952381) internal successors, (1409), 21 states have internal predecessors, (1409), 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 01:03:29,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:29,752 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:29,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:03:29,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:29,953 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:29,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:29,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1564044418, now seen corresponding path program 1 times [2025-01-10 01:03:29,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:29,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521477192] [2025-01-10 01:03:29,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:29,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:03:29,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:03:29,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:29,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:30,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521477192] [2025-01-10 01:03:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521477192] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:30,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575065622] [2025-01-10 01:03:30,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:30,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:30,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:30,060 INFO L229 MonitoredProcess]: Starting monitored process 12 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 01:03:30,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:03:30,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:03:30,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:03:30,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:30,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:30,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:30,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:30,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:30,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575065622] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:30,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:30,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-10 01:03:30,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365794356] [2025-01-10 01:03:30,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:30,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:30,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:30,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:30,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:30,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:30,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 165 transitions, 943 flow. Second operand has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 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 01:03:30,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:30,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:30,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:34,775 INFO L124 PetriNetUnfolderBase]: 26713/58593 cut-off events. [2025-01-10 01:03:34,775 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-01-10 01:03:35,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95629 conditions, 58593 events. 26713/58593 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 2900. Compared 693668 event pairs, 16848 based on Foata normal form. 6/45687 useless extension candidates. Maximal degree in co-relation 95553. Up to 18070 conditions per place. [2025-01-10 01:03:35,242 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 133 selfloop transitions, 51 changer transitions 0/238 dead transitions. [2025-01-10 01:03:35,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 238 transitions, 1711 flow [2025-01-10 01:03:35,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:03:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:03:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 641 transitions. [2025-01-10 01:03:35,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6677083333333333 [2025-01-10 01:03:35,244 INFO L175 Difference]: Start difference. First operand has 159 places, 165 transitions, 943 flow. Second operand 8 states and 641 transitions. [2025-01-10 01:03:35,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 238 transitions, 1711 flow [2025-01-10 01:03:35,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 238 transitions, 1610 flow, removed 36 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:35,251 INFO L231 Difference]: Finished difference. Result has 167 places, 182 transitions, 1217 flow [2025-01-10 01:03:35,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1217, PETRI_PLACES=167, PETRI_TRANSITIONS=182} [2025-01-10 01:03:35,253 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 53 predicate places. [2025-01-10 01:03:35,253 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 182 transitions, 1217 flow [2025-01-10 01:03:35,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 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 01:03:35,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:35,253 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:35,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:03:35,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 01:03:35,454 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:35,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2083013217, now seen corresponding path program 2 times [2025-01-10 01:03:35,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:35,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128668954] [2025-01-10 01:03:35,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:35,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:35,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:03:35,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:03:35,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:35,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:35,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:35,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128668954] [2025-01-10 01:03:35,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128668954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:35,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891301636] [2025-01-10 01:03:35,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:35,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:35,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:35,838 INFO L229 MonitoredProcess]: Starting monitored process 13 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 01:03:35,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:03:35,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:03:35,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:03:35,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:35,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:35,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:03:35,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:36,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-10 01:03:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:36,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:03:36,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891301636] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:36,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:36,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 4] total 18 [2025-01-10 01:03:36,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483543] [2025-01-10 01:03:36,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:36,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:03:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:36,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:03:36,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:03:37,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:37,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 182 transitions, 1217 flow. Second operand has 19 states, 19 states have (on average 68.36842105263158) internal successors, (1299), 19 states have internal predecessors, (1299), 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 01:03:37,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:37,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:37,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:44,565 INFO L124 PetriNetUnfolderBase]: 40272/88489 cut-off events. [2025-01-10 01:03:44,565 INFO L125 PetriNetUnfolderBase]: For 980/980 co-relation queries the response was YES. [2025-01-10 01:03:45,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144288 conditions, 88489 events. 40272/88489 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 4157. Compared 1097323 event pairs, 25332 based on Foata normal form. 0/68701 useless extension candidates. Maximal degree in co-relation 144186. Up to 36144 conditions per place. [2025-01-10 01:03:45,706 INFO L140 encePairwiseOnDemand]: 108/120 looper letters, 148 selfloop transitions, 58 changer transitions 0/258 dead transitions. [2025-01-10 01:03:45,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 258 transitions, 2048 flow [2025-01-10 01:03:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:03:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 01:03:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1221 transitions. [2025-01-10 01:03:45,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5985294117647059 [2025-01-10 01:03:45,711 INFO L175 Difference]: Start difference. First operand has 167 places, 182 transitions, 1217 flow. Second operand 17 states and 1221 transitions. [2025-01-10 01:03:45,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 258 transitions, 2048 flow [2025-01-10 01:03:45,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 258 transitions, 2046 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 01:03:45,719 INFO L231 Difference]: Finished difference. Result has 183 places, 198 transitions, 1493 flow [2025-01-10 01:03:45,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1493, PETRI_PLACES=183, PETRI_TRANSITIONS=198} [2025-01-10 01:03:45,721 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 69 predicate places. [2025-01-10 01:03:45,721 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 198 transitions, 1493 flow [2025-01-10 01:03:45,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 68.36842105263158) internal successors, (1299), 19 states have internal predecessors, (1299), 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 01:03:45,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:45,722 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 01:03:45,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:03:45,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:45,926 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:45,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash 192120921, now seen corresponding path program 1 times [2025-01-10 01:03:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:45,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666506823] [2025-01-10 01:03:45,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:45,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:03:45,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:03:45,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:45,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:03:46,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:46,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666506823] [2025-01-10 01:03:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666506823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:46,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788492747] [2025-01-10 01:03:46,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:46,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:46,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:46,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:46,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 120 [2025-01-10 01:03:46,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 198 transitions, 1493 flow. Second operand has 5 states, 5 states have (on average 63.2) internal successors, (316), 5 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 01:03:46,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:46,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 120 [2025-01-10 01:03:46,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:55,275 INFO L124 PetriNetUnfolderBase]: 51606/106171 cut-off events. [2025-01-10 01:03:55,275 INFO L125 PetriNetUnfolderBase]: For 1208/1208 co-relation queries the response was YES. [2025-01-10 01:03:55,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177731 conditions, 106171 events. 51606/106171 cut-off events. For 1208/1208 co-relation queries the response was YES. Maximal size of possible extension queue 5087. Compared 1286050 event pairs, 33696 based on Foata normal form. 0/87325 useless extension candidates. Maximal degree in co-relation 177633. Up to 69132 conditions per place.