./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series.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/popl20-more-buffer-series.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 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:09:08,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:09:08,725 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:09:08,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:09:08,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:09:08,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:09:08,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:09:08,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:09:08,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:09:08,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:09:08,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:09:08,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:09:08,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:09:08,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:09:08,744 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:09:08,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:09:08,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:09:08,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:09:08,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:08,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:08,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:09:08,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:09:08,746 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 -> 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c [2025-01-10 01:09:08,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:09:08,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:09:08,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:09:08,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:09:08,994 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:09:08,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-01-10 01:09:10,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c296b5c26/2d4c3581f06e452b86769748689d2e52/FLAGe456b33a0 [2025-01-10 01:09:10,436 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:09:10,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-01-10 01:09:10,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c296b5c26/2d4c3581f06e452b86769748689d2e52/FLAGe456b33a0 [2025-01-10 01:09:10,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c296b5c26/2d4c3581f06e452b86769748689d2e52 [2025-01-10 01:09:10,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:09:10,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:09:10,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:09:10,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:09:10,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:09:10,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3aa120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10, skipping insertion in model container [2025-01-10 01:09:10,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:09:10,648 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:09:10,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:09:10,665 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:09:10,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:09:10,710 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:09:10,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10 WrapperNode [2025-01-10 01:09:10,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:09:10,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:09:10,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:09:10,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:09:10,719 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:09:10" (1/1) ... [2025-01-10 01:09:10,727 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:09:10" (1/1) ... [2025-01-10 01:09:10,753 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 321 [2025-01-10 01:09:10,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:09:10,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:09:10,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:09:10,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:09:10,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,775 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-10 01:09:10,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:09:10,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:09:10,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:09:10,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:09:10,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (1/1) ... [2025-01-10 01:09:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:10,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:10,820 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:09:10,822 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:09:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:09:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:09:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:09:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:09:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:09:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:09:10,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:09:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:09:10,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:09:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:09:10,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:09:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:09:10,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:09:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:09:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:09:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:09:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:09:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:09:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:09:10,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:09:10,842 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:09:10,915 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:09:10,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:09:11,296 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:09:11,296 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:09:11,597 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:09:11,597 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:09:11,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:11 BoogieIcfgContainer [2025-01-10 01:09:11,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:09:11,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:09:11,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:09:11,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:09:11,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:09:10" (1/3) ... [2025-01-10 01:09:11,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9502b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:11, skipping insertion in model container [2025-01-10 01:09:11,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:10" (2/3) ... [2025-01-10 01:09:11,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9502b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:11, skipping insertion in model container [2025-01-10 01:09:11,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:11" (3/3) ... [2025-01-10 01:09:11,606 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2025-01-10 01:09:11,618 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:09:11,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series.wvr.c that has 5 procedures, 71 locations, 1 initial locations, 7 loop locations, and 22 error locations. [2025-01-10 01:09:11,620 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:09:11,684 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:09:11,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 77 transitions, 182 flow [2025-01-10 01:09:11,765 INFO L124 PetriNetUnfolderBase]: 7/73 cut-off events. [2025-01-10 01:09:11,768 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:09:11,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 73 events. 7/73 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 197 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2025-01-10 01:09:11,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 77 transitions, 182 flow [2025-01-10 01:09:11,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 72 transitions, 168 flow [2025-01-10 01:09:11,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:09:11,797 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;@50d1af33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:09:11,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-10 01:09:11,801 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:09:11,801 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:09:11,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:09:11,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:11,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:09:11,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:11,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash 991934, now seen corresponding path program 1 times [2025-01-10 01:09:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:11,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776059834] [2025-01-10 01:09:11,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:11,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:09:11,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:09:11,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:11,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:12,018 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:09:12,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776059834] [2025-01-10 01:09:12,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776059834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:12,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:12,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:09:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863707310] [2025-01-10 01:09:12,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:12,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:12,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:12,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:12,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:12,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:09:12,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:12,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:12,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:14,091 INFO L124 PetriNetUnfolderBase]: 17936/23922 cut-off events. [2025-01-10 01:09:14,092 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2025-01-10 01:09:14,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46767 conditions, 23922 events. 17936/23922 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 154141 event pairs, 11530 based on Foata normal form. 1/11214 useless extension candidates. Maximal degree in co-relation 44660. Up to 21814 conditions per place. [2025-01-10 01:09:14,314 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 43 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-01-10 01:09:14,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 244 flow [2025-01-10 01:09:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-10 01:09:14,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-01-10 01:09:14,328 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 168 flow. Second operand 3 states and 126 transitions. [2025-01-10 01:09:14,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 244 flow [2025-01-10 01:09:14,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 228 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:09:14,432 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 142 flow [2025-01-10 01:09:14,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2025-01-10 01:09:14,439 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -13 predicate places. [2025-01-10 01:09:14,439 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 142 flow [2025-01-10 01:09:14,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:09:14,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:14,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:09:14,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:09:14,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:14,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash 991935, now seen corresponding path program 1 times [2025-01-10 01:09:14,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:14,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214013934] [2025-01-10 01:09:14,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:14,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:09:14,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:09:14,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:14,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:14,676 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:09:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:14,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214013934] [2025-01-10 01:09:14,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214013934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:14,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:14,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904102101] [2025-01-10 01:09:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:14,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:14,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:14,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:14,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:14,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:14,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:09:14,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:14,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:14,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:16,116 INFO L124 PetriNetUnfolderBase]: 17937/23925 cut-off events. [2025-01-10 01:09:16,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:09:16,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46151 conditions, 23925 events. 17937/23925 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 154393 event pairs, 11530 based on Foata normal form. 0/11213 useless extension candidates. Maximal degree in co-relation 46114. Up to 21827 conditions per place. [2025-01-10 01:09:16,253 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 47 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2025-01-10 01:09:16,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 250 flow [2025-01-10 01:09:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-01-10 01:09:16,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2025-01-10 01:09:16,258 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 142 flow. Second operand 4 states and 152 transitions. [2025-01-10 01:09:16,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 250 flow [2025-01-10 01:09:16,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:16,262 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 165 flow [2025-01-10 01:09:16,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2025-01-10 01:09:16,263 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2025-01-10 01:09:16,263 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 165 flow [2025-01-10 01:09:16,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:09:16,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:16,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:09:16,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:09:16,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:16,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash 30752630, now seen corresponding path program 1 times [2025-01-10 01:09:16,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:16,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924368968] [2025-01-10 01:09:16,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:16,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:16,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:09:16,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:09:16,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:16,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:16,508 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:09:16,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:16,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924368968] [2025-01-10 01:09:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924368968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:16,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:16,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:16,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838524008] [2025-01-10 01:09:16,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:16,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:16,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:16,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:16,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:16,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:16,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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:09:16,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:16,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:16,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:18,239 INFO L124 PetriNetUnfolderBase]: 17938/23928 cut-off events. [2025-01-10 01:09:18,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:09:18,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46168 conditions, 23928 events. 17938/23928 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 154440 event pairs, 11530 based on Foata normal form. 0/11215 useless extension candidates. Maximal degree in co-relation 46143. Up to 21826 conditions per place. [2025-01-10 01:09:18,363 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 47 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2025-01-10 01:09:18,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 279 flow [2025-01-10 01:09:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2025-01-10 01:09:18,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-01-10 01:09:18,369 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 165 flow. Second operand 5 states and 180 transitions. [2025-01-10 01:09:18,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 279 flow [2025-01-10 01:09:18,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:18,371 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 199 flow [2025-01-10 01:09:18,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2025-01-10 01:09:18,372 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2025-01-10 01:09:18,372 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 199 flow [2025-01-10 01:09:18,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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:09:18,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:18,373 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:09:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:09:18,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash 953281431, now seen corresponding path program 1 times [2025-01-10 01:09:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:18,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283581487] [2025-01-10 01:09:18,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:18,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:18,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:18,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:18,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:18,564 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:09:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:18,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283581487] [2025-01-10 01:09:18,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283581487] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:18,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638341849] [2025-01-10 01:09:18,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:18,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:18,568 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:09:18,569 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:09:18,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:18,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:09:18,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:18,673 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:09:18,785 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:09:18,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:18,854 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:09:18,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638341849] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:18,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:18,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:09:18,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015748235] [2025-01-10 01:09:18,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:18,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:09:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:18,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:09:18,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:09:18,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:18,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 199 flow. Second operand has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 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:09:18,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:18,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:18,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:20,159 INFO L124 PetriNetUnfolderBase]: 17939/23930 cut-off events. [2025-01-10 01:09:20,160 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:09:20,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46191 conditions, 23930 events. 17939/23930 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 154607 event pairs, 11530 based on Foata normal form. 0/11220 useless extension candidates. Maximal degree in co-relation 46153. Up to 21827 conditions per place. [2025-01-10 01:09:20,330 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 46 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2025-01-10 01:09:20,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 73 transitions, 322 flow [2025-01-10 01:09:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:09:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:09:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 255 transitions. [2025-01-10 01:09:20,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.413961038961039 [2025-01-10 01:09:20,332 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 199 flow. Second operand 8 states and 255 transitions. [2025-01-10 01:09:20,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 73 transitions, 322 flow [2025-01-10 01:09:20,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 73 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:20,333 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 229 flow [2025-01-10 01:09:20,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2025-01-10 01:09:20,334 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 0 predicate places. [2025-01-10 01:09:20,334 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 229 flow [2025-01-10 01:09:20,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 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:09:20,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:20,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:09:20,341 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:09:20,539 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:09:20,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:20,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash 953333543, now seen corresponding path program 1 times [2025-01-10 01:09:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:20,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503316486] [2025-01-10 01:09:20,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:20,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:20,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:20,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:20,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:20,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:20,704 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:09:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:20,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503316486] [2025-01-10 01:09:20,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503316486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758811222] [2025-01-10 01:09:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:20,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:20,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:20,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:20,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:20,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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:09:20,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:20,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:20,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:21,952 INFO L124 PetriNetUnfolderBase]: 17940/23933 cut-off events. [2025-01-10 01:09:21,952 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:09:21,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46207 conditions, 23933 events. 17940/23933 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 154661 event pairs, 11530 based on Foata normal form. 0/11222 useless extension candidates. Maximal degree in co-relation 46161. Up to 21831 conditions per place. [2025-01-10 01:09:22,064 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 50 selfloop transitions, 9 changer transitions 0/76 dead transitions. [2025-01-10 01:09:22,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 76 transitions, 353 flow [2025-01-10 01:09:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-01-10 01:09:22,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4649350649350649 [2025-01-10 01:09:22,065 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 229 flow. Second operand 5 states and 179 transitions. [2025-01-10 01:09:22,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 76 transitions, 353 flow [2025-01-10 01:09:22,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 76 transitions, 306 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 01:09:22,067 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 225 flow [2025-01-10 01:09:22,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2025-01-10 01:09:22,068 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2025-01-10 01:09:22,068 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 225 flow [2025-01-10 01:09:22,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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:09:22,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:22,068 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:09:22,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:09:22,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:22,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash -511461299, now seen corresponding path program 1 times [2025-01-10 01:09:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:22,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544279543] [2025-01-10 01:09:22,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:22,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:22,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:22,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:22,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:22,249 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:09:22,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:22,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544279543] [2025-01-10 01:09:22,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544279543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393577147] [2025-01-10 01:09:22,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:22,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:22,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:22,252 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:09:22,254 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:09:22,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:22,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:22,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:22,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:22,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:09:22,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:22,333 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:09:22,436 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:09:22,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:22,574 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:09:22,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393577147] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:22,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:22,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:09:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505363243] [2025-01-10 01:09:22,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:22,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:09:22,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:22,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:09:22,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:09:22,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:22,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 225 flow. Second operand has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 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:09:22,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:22,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:22,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:24,233 INFO L124 PetriNetUnfolderBase]: 17940/23932 cut-off events. [2025-01-10 01:09:24,234 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:09:24,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46199 conditions, 23932 events. 17940/23932 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 154641 event pairs, 11530 based on Foata normal form. 0/11224 useless extension candidates. Maximal degree in co-relation 46150. Up to 21821 conditions per place. [2025-01-10 01:09:24,388 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 43 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2025-01-10 01:09:24,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 337 flow [2025-01-10 01:09:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2025-01-10 01:09:24,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4230055658627087 [2025-01-10 01:09:24,390 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 225 flow. Second operand 7 states and 228 transitions. [2025-01-10 01:09:24,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 337 flow [2025-01-10 01:09:24,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:24,391 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 244 flow [2025-01-10 01:09:24,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-01-10 01:09:24,392 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-01-10 01:09:24,392 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 244 flow [2025-01-10 01:09:24,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 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:09:24,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:24,392 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:09:24,398 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:09:24,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:24,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:24,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:24,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1325531928, now seen corresponding path program 1 times [2025-01-10 01:09:24,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:24,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008091020] [2025-01-10 01:09:24,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:24,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:24,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:09:24,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:09:24,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:24,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:24,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:24,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008091020] [2025-01-10 01:09:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008091020] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:24,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054733882] [2025-01-10 01:09:24,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:24,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:24,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:24,867 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:09:24,869 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:09:24,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:09:24,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:09:24,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:24,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:24,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:09:24,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:24,965 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:09:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:25,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:25,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054733882] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:25,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:25,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:09:25,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626083824] [2025-01-10 01:09:25,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:25,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:09:25,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:25,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:09:25,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:09:25,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:25,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 244 flow. Second operand has 13 states, 13 states have (on average 26.46153846153846) internal successors, (344), 13 states have internal predecessors, (344), 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:09:25,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:25,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:25,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:26,988 INFO L124 PetriNetUnfolderBase]: 17940/23931 cut-off events. [2025-01-10 01:09:26,988 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:09:27,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46207 conditions, 23931 events. 17940/23931 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 154428 event pairs, 11530 based on Foata normal form. 0/11224 useless extension candidates. Maximal degree in co-relation 46152. Up to 21821 conditions per place. [2025-01-10 01:09:27,116 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 39 selfloop transitions, 18 changer transitions 0/74 dead transitions. [2025-01-10 01:09:27,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 354 flow [2025-01-10 01:09:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2025-01-10 01:09:27,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42115027829313545 [2025-01-10 01:09:27,118 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 244 flow. Second operand 7 states and 227 transitions. [2025-01-10 01:09:27,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 354 flow [2025-01-10 01:09:27,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 327 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 01:09:27,119 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 249 flow [2025-01-10 01:09:27,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-01-10 01:09:27,119 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-01-10 01:09:27,119 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 249 flow [2025-01-10 01:09:27,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.46153846153846) internal successors, (344), 13 states have internal predecessors, (344), 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:09:27,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:27,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:27,125 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:09:27,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:27,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:27,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1688772734, now seen corresponding path program 1 times [2025-01-10 01:09:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:27,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385862366] [2025-01-10 01:09:27,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:27,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:27,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:09:27,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:09:27,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:27,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:27,384 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:09:27,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:27,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385862366] [2025-01-10 01:09:27,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385862366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:27,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:27,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368242841] [2025-01-10 01:09:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:27,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:27,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:27,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:27,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:27,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:27,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:09:27,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:27,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:27,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:28,203 INFO L124 PetriNetUnfolderBase]: 13482/18168 cut-off events. [2025-01-10 01:09:28,203 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:09:28,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35025 conditions, 18168 events. 13482/18168 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 1506. Compared 116463 event pairs, 8782 based on Foata normal form. 0/9213 useless extension candidates. Maximal degree in co-relation 34964. Up to 16483 conditions per place. [2025-01-10 01:09:28,318 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 52 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-01-10 01:09:28,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 355 flow [2025-01-10 01:09:28,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-01-10 01:09:28,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4707792207792208 [2025-01-10 01:09:28,319 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 249 flow. Second operand 4 states and 145 transitions. [2025-01-10 01:09:28,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 355 flow [2025-01-10 01:09:28,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 72 transitions, 319 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 01:09:28,320 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 215 flow [2025-01-10 01:09:28,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2025-01-10 01:09:28,321 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2025-01-10 01:09:28,321 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 215 flow [2025-01-10 01:09:28,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:09:28,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:28,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:28,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:09:28,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:28,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1688772733, now seen corresponding path program 1 times [2025-01-10 01:09:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:28,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973109377] [2025-01-10 01:09:28,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:28,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:09:28,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:09:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973109377] [2025-01-10 01:09:28,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973109377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:28,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:28,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470743875] [2025-01-10 01:09:28,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:28,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:28,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:28,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:28,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-01-10 01:09:28,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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:09:28,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:28,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-01-10 01:09:28,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:29,233 INFO L124 PetriNetUnfolderBase]: 14728/19996 cut-off events. [2025-01-10 01:09:29,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:09:29,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38578 conditions, 19996 events. 14728/19996 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 130354 event pairs, 9699 based on Foata normal form. 347/11038 useless extension candidates. Maximal degree in co-relation 34887. Up to 16501 conditions per place. [2025-01-10 01:09:29,343 INFO L140 encePairwiseOnDemand]: 63/77 looper letters, 85 selfloop transitions, 7 changer transitions 0/109 dead transitions. [2025-01-10 01:09:29,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 109 transitions, 509 flow [2025-01-10 01:09:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2025-01-10 01:09:29,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974025974025974 [2025-01-10 01:09:29,344 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 215 flow. Second operand 5 states and 230 transitions. [2025-01-10 01:09:29,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 109 transitions, 509 flow [2025-01-10 01:09:29,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:29,346 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 273 flow [2025-01-10 01:09:29,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2025-01-10 01:09:29,346 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 0 predicate places. [2025-01-10 01:09:29,346 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 273 flow [2025-01-10 01:09:29,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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:09:29,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:29,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:29,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:09:29,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:29,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash -429449738, now seen corresponding path program 1 times [2025-01-10 01:09:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:29,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564694883] [2025-01-10 01:09:29,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:29,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:09:29,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:09:29,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:29,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:29,417 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:09:29,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:29,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564694883] [2025-01-10 01:09:29,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564694883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:29,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:29,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:29,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695825889] [2025-01-10 01:09:29,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:29,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:29,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:29,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:29,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:29,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-01-10 01:09:29,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:09:29,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:29,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-01-10 01:09:29,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:30,550 INFO L124 PetriNetUnfolderBase]: 16145/22639 cut-off events. [2025-01-10 01:09:30,550 INFO L125 PetriNetUnfolderBase]: For 1700/1700 co-relation queries the response was YES. [2025-01-10 01:09:30,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49540 conditions, 22639 events. 16145/22639 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 1633. Compared 158279 event pairs, 10806 based on Foata normal form. 325/12568 useless extension candidates. Maximal degree in co-relation 45444. Up to 18181 conditions per place. [2025-01-10 01:09:30,640 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 86 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-01-10 01:09:30,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 573 flow [2025-01-10 01:09:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-01-10 01:09:30,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6266233766233766 [2025-01-10 01:09:30,642 INFO L175 Difference]: Start difference. First operand has 78 places, 76 transitions, 273 flow. Second operand 4 states and 193 transitions. [2025-01-10 01:09:30,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 573 flow [2025-01-10 01:09:30,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 109 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:30,648 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 295 flow [2025-01-10 01:09:30,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2025-01-10 01:09:30,649 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 2 predicate places. [2025-01-10 01:09:30,649 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 295 flow [2025-01-10 01:09:30,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:09:30,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:30,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:30,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:09:30,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 992355928, now seen corresponding path program 1 times [2025-01-10 01:09:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818878786] [2025-01-10 01:09:30,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:30,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:09:30,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:09:30,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:30,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818878786] [2025-01-10 01:09:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818878786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:30,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86029683] [2025-01-10 01:09:30,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:30,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:30,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:30,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:30,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:30,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:09:30,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:30,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:30,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:31,509 INFO L124 PetriNetUnfolderBase]: 11344/16468 cut-off events. [2025-01-10 01:09:31,509 INFO L125 PetriNetUnfolderBase]: For 2582/2582 co-relation queries the response was YES. [2025-01-10 01:09:31,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39275 conditions, 16468 events. 11344/16468 cut-off events. For 2582/2582 co-relation queries the response was YES. Maximal size of possible extension queue 1166. Compared 116125 event pairs, 7648 based on Foata normal form. 0/9818 useless extension candidates. Maximal degree in co-relation 31083. Up to 14309 conditions per place. [2025-01-10 01:09:31,602 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 50 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2025-01-10 01:09:31,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 74 transitions, 401 flow [2025-01-10 01:09:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-01-10 01:09:31,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-01-10 01:09:31,604 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 295 flow. Second operand 5 states and 168 transitions. [2025-01-10 01:09:31,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 74 transitions, 401 flow [2025-01-10 01:09:31,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:31,610 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 296 flow [2025-01-10 01:09:31,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2025-01-10 01:09:31,611 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2025-01-10 01:09:31,611 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 296 flow [2025-01-10 01:09:31,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:09:31,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:31,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:31,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:09:31,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:31,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash 992355929, now seen corresponding path program 1 times [2025-01-10 01:09:31,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:31,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505300588] [2025-01-10 01:09:31,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:31,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:09:31,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:09:31,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:31,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:31,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:31,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505300588] [2025-01-10 01:09:31,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505300588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:31,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:31,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764403] [2025-01-10 01:09:31,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:31,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:31,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:31,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:31,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:31,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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:09:31,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:31,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:31,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:33,771 INFO L124 PetriNetUnfolderBase]: 30621/42852 cut-off events. [2025-01-10 01:09:33,771 INFO L125 PetriNetUnfolderBase]: For 5815/6325 co-relation queries the response was YES. [2025-01-10 01:09:33,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103333 conditions, 42852 events. 30621/42852 cut-off events. For 5815/6325 co-relation queries the response was YES. Maximal size of possible extension queue 2733. Compared 312682 event pairs, 13294 based on Foata normal form. 0/27297 useless extension candidates. Maximal degree in co-relation 78875. Up to 16226 conditions per place. [2025-01-10 01:09:34,063 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 129 selfloop transitions, 10 changer transitions 0/153 dead transitions. [2025-01-10 01:09:34,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 153 transitions, 810 flow [2025-01-10 01:09:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:09:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:09:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 277 transitions. [2025-01-10 01:09:34,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5995670995670995 [2025-01-10 01:09:34,064 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 296 flow. Second operand 6 states and 277 transitions. [2025-01-10 01:09:34,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 153 transitions, 810 flow [2025-01-10 01:09:34,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 153 transitions, 799 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:09:34,075 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 326 flow [2025-01-10 01:09:34,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2025-01-10 01:09:34,076 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2025-01-10 01:09:34,076 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 326 flow [2025-01-10 01:09:34,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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:09:34,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:34,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:34,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:09:34,076 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 392543178, now seen corresponding path program 1 times [2025-01-10 01:09:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:34,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721253695] [2025-01-10 01:09:34,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:34,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:09:34,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:09:34,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:34,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:34,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:34,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721253695] [2025-01-10 01:09:34,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721253695] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:34,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894004165] [2025-01-10 01:09:34,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:34,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:34,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:34,377 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:09:34,379 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:09:34,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:09:34,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:09:34,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:34,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:34,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:09:34,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:34,447 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:09:34,449 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 6 treesize of output 5 [2025-01-10 01:09:34,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:09:34,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:09:34,515 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:09:34,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:09:34,538 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:09:34,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-10 01:09:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:34,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:34,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894004165] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:34,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:34,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2025-01-10 01:09:34,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25131609] [2025-01-10 01:09:34,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:34,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:09:34,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:34,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:09:34,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:09:35,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 77 [2025-01-10 01:09:35,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 326 flow. Second operand has 17 states, 17 states have (on average 23.764705882352942) internal successors, (404), 17 states have internal predecessors, (404), 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:09:35,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:35,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 77 [2025-01-10 01:09:35,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:40,371 INFO L124 PetriNetUnfolderBase]: 29117/42759 cut-off events. [2025-01-10 01:09:40,372 INFO L125 PetriNetUnfolderBase]: For 7544/7544 co-relation queries the response was YES. [2025-01-10 01:09:40,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104673 conditions, 42759 events. 29117/42759 cut-off events. For 7544/7544 co-relation queries the response was YES. Maximal size of possible extension queue 2721. Compared 349358 event pairs, 22499 based on Foata normal form. 0/28007 useless extension candidates. Maximal degree in co-relation 47982. Up to 24467 conditions per place. [2025-01-10 01:09:40,662 INFO L140 encePairwiseOnDemand]: 65/77 looper letters, 95 selfloop transitions, 44 changer transitions 0/157 dead transitions. [2025-01-10 01:09:40,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 157 transitions, 958 flow [2025-01-10 01:09:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:09:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:09:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 481 transitions. [2025-01-10 01:09:40,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39042207792207795 [2025-01-10 01:09:40,664 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 326 flow. Second operand 16 states and 481 transitions. [2025-01-10 01:09:40,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 157 transitions, 958 flow [2025-01-10 01:09:40,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 157 transitions, 955 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:40,676 INFO L231 Difference]: Finished difference. Result has 105 places, 105 transitions, 667 flow [2025-01-10 01:09:40,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=667, PETRI_PLACES=105, PETRI_TRANSITIONS=105} [2025-01-10 01:09:40,677 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 27 predicate places. [2025-01-10 01:09:40,677 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 667 flow [2025-01-10 01:09:40,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 23.764705882352942) internal successors, (404), 17 states have internal predecessors, (404), 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:09:40,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:40,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:40,683 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:09:40,878 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,SelfDestructingSolverStorable12 [2025-01-10 01:09:40,878 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:40,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:40,878 INFO L85 PathProgramCache]: Analyzing trace with hash 392543180, now seen corresponding path program 1 times [2025-01-10 01:09:40,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:40,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359204863] [2025-01-10 01:09:40,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:40,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:40,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:09:40,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:09:40,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:40,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:40,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:40,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359204863] [2025-01-10 01:09:40,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359204863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:40,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709585835] [2025-01-10 01:09:40,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:40,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:40,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:40,972 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:09:40,973 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:09:41,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:09:41,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:09:41,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:41,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:41,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:09:41,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:41,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:41,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:09:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:41,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709585835] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:41,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:09:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567444737] [2025-01-10 01:09:41,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:09:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:41,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:09:41,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:09:41,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-01-10 01:09:41,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 667 flow. Second operand has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 12 states have internal predecessors, (358), 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:09:41,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:41,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-01-10 01:09:41,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:43,784 INFO L124 PetriNetUnfolderBase]: 26690/39192 cut-off events. [2025-01-10 01:09:43,785 INFO L125 PetriNetUnfolderBase]: For 12199/12199 co-relation queries the response was YES. [2025-01-10 01:09:43,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97482 conditions, 39192 events. 26690/39192 cut-off events. For 12199/12199 co-relation queries the response was YES. Maximal size of possible extension queue 2324. Compared 311557 event pairs, 11101 based on Foata normal form. 0/28473 useless extension candidates. Maximal degree in co-relation 97288. Up to 13319 conditions per place. [2025-01-10 01:09:44,073 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 132 selfloop transitions, 30 changer transitions 0/180 dead transitions. [2025-01-10 01:09:44,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 180 transitions, 1225 flow [2025-01-10 01:09:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 323 transitions. [2025-01-10 01:09:44,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5992578849721707 [2025-01-10 01:09:44,075 INFO L175 Difference]: Start difference. First operand has 105 places, 105 transitions, 667 flow. Second operand 7 states and 323 transitions. [2025-01-10 01:09:44,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 180 transitions, 1225 flow [2025-01-10 01:09:44,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 180 transitions, 1213 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:44,096 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 733 flow [2025-01-10 01:09:44,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=733, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-01-10 01:09:44,096 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 33 predicate places. [2025-01-10 01:09:44,096 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 733 flow [2025-01-10 01:09:44,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 12 states have internal predecessors, (358), 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:09:44,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:44,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:44,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:09:44,297 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:09:44,297 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:44,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1914590528, now seen corresponding path program 1 times [2025-01-10 01:09:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:44,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620362835] [2025-01-10 01:09:44,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:44,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:44,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:09:44,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:09:44,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:44,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:44,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:44,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620362835] [2025-01-10 01:09:44,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620362835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:44,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:44,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:09:44,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813796544] [2025-01-10 01:09:44,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:44,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:44,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:44,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:44,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:44,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 733 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:09:44,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:44,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:44,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:46,156 INFO L124 PetriNetUnfolderBase]: 19218/29511 cut-off events. [2025-01-10 01:09:46,156 INFO L125 PetriNetUnfolderBase]: For 16673/16673 co-relation queries the response was YES. [2025-01-10 01:09:46,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74909 conditions, 29511 events. 19218/29511 cut-off events. For 16673/16673 co-relation queries the response was YES. Maximal size of possible extension queue 1822. Compared 243835 event pairs, 14976 based on Foata normal form. 0/23065 useless extension candidates. Maximal degree in co-relation 74704. Up to 25488 conditions per place. [2025-01-10 01:09:46,383 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 74 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2025-01-10 01:09:46,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 897 flow [2025-01-10 01:09:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 01:09:46,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4577922077922078 [2025-01-10 01:09:46,384 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 733 flow. Second operand 4 states and 141 transitions. [2025-01-10 01:09:46,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 897 flow [2025-01-10 01:09:46,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 104 transitions, 821 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 01:09:46,405 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 673 flow [2025-01-10 01:09:46,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=673, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2025-01-10 01:09:46,406 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 30 predicate places. [2025-01-10 01:09:46,406 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 673 flow [2025-01-10 01:09:46,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:09:46,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:46,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:46,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:09:46,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:46,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1914590526, now seen corresponding path program 1 times [2025-01-10 01:09:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:46,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391636398] [2025-01-10 01:09:46,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:46,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:09:46,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:09:46,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:46,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:46,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391636398] [2025-01-10 01:09:46,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391636398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:46,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:46,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:46,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301373389] [2025-01-10 01:09:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:46,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:46,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:46,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:46,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:46,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:46,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 673 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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:09:46,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:46,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:46,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:49,185 INFO L124 PetriNetUnfolderBase]: 33710/48514 cut-off events. [2025-01-10 01:09:49,186 INFO L125 PetriNetUnfolderBase]: For 31469/33656 co-relation queries the response was YES. [2025-01-10 01:09:49,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127330 conditions, 48514 events. 33710/48514 cut-off events. For 31469/33656 co-relation queries the response was YES. Maximal size of possible extension queue 3018. Compared 389267 event pairs, 17004 based on Foata normal form. 0/39677 useless extension candidates. Maximal degree in co-relation 127129. Up to 24386 conditions per place. [2025-01-10 01:09:49,595 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 133 selfloop transitions, 20 changer transitions 0/168 dead transitions. [2025-01-10 01:09:49,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 168 transitions, 1184 flow [2025-01-10 01:09:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:09:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:09:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 258 transitions. [2025-01-10 01:09:49,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2025-01-10 01:09:49,596 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 673 flow. Second operand 6 states and 258 transitions. [2025-01-10 01:09:49,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 168 transitions, 1184 flow [2025-01-10 01:09:49,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 168 transitions, 1169 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:49,623 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 729 flow [2025-01-10 01:09:49,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=729, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2025-01-10 01:09:49,624 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 36 predicate places. [2025-01-10 01:09:49,624 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 729 flow [2025-01-10 01:09:49,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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:09:49,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:49,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:49,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:09:49,624 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:49,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:49,625 INFO L85 PathProgramCache]: Analyzing trace with hash 406223407, now seen corresponding path program 1 times [2025-01-10 01:09:49,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:49,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183161487] [2025-01-10 01:09:49,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:49,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:09:49,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:09:49,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:49,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:49,731 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:09:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183161487] [2025-01-10 01:09:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183161487] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796753264] [2025-01-10 01:09:49,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:49,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:49,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:49,734 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:09:49,735 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:09:49,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:09:49,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:09:49,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:49,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:49,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:09:49,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:49,865 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:09:49,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:49,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:09:49,941 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:09:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796753264] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:49,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:09:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676762710] [2025-01-10 01:09:49,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:49,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:09:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:49,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:09:49,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:09:50,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-01-10 01:09:50,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 729 flow. Second operand has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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:09:50,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:50,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-01-10 01:09:50,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:52,055 INFO L124 PetriNetUnfolderBase]: 21066/32184 cut-off events. [2025-01-10 01:09:52,055 INFO L125 PetriNetUnfolderBase]: For 21545/21545 co-relation queries the response was YES. [2025-01-10 01:09:52,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85540 conditions, 32184 events. 21066/32184 cut-off events. For 21545/21545 co-relation queries the response was YES. Maximal size of possible extension queue 2057. Compared 268543 event pairs, 9752 based on Foata normal form. 0/27224 useless extension candidates. Maximal degree in co-relation 85328. Up to 13165 conditions per place. [2025-01-10 01:09:52,437 INFO L140 encePairwiseOnDemand]: 66/77 looper letters, 122 selfloop transitions, 31 changer transitions 0/172 dead transitions. [2025-01-10 01:09:52,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 172 transitions, 1266 flow [2025-01-10 01:09:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 308 transitions. [2025-01-10 01:09:52,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 01:09:52,439 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 729 flow. Second operand 7 states and 308 transitions. [2025-01-10 01:09:52,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 172 transitions, 1266 flow [2025-01-10 01:09:52,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 172 transitions, 1247 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:52,464 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 797 flow [2025-01-10 01:09:52,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=797, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2025-01-10 01:09:52,464 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 42 predicate places. [2025-01-10 01:09:52,464 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 797 flow [2025-01-10 01:09:52,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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:09:52,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:52,465 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:52,471 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:09:52,665 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,SelfDestructingSolverStorable16 [2025-01-10 01:09:52,665 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash 306534050, now seen corresponding path program 2 times [2025-01-10 01:09:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140536084] [2025-01-10 01:09:52,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:52,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:52,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:09:52,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:09:52,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:52,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:52,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:52,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140536084] [2025-01-10 01:09:52,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140536084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:52,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97751771] [2025-01-10 01:09:52,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:52,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:52,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:52,871 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:09:52,873 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:09:52,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:09:52,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:09:52,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:52,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:52,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:09:52,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:52,947 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 6 treesize of output 5 [2025-01-10 01:09:52,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:09:52,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:09:52,998 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:09:52,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:09:53,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:09:53,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:09:53,024 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:09:53,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:09:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:09:53,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:09:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97751771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:53,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:09:53,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2025-01-10 01:09:53,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193586584] [2025-01-10 01:09:53,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:53,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:53,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:53,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:53,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:09:53,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:53,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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:09:53,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:53,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:53,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:54,576 INFO L124 PetriNetUnfolderBase]: 15950/24870 cut-off events. [2025-01-10 01:09:54,576 INFO L125 PetriNetUnfolderBase]: For 24549/24549 co-relation queries the response was YES. [2025-01-10 01:09:54,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68950 conditions, 24870 events. 15950/24870 cut-off events. For 24549/24549 co-relation queries the response was YES. Maximal size of possible extension queue 1563. Compared 209421 event pairs, 14565 based on Foata normal form. 1406/22855 useless extension candidates. Maximal degree in co-relation 68732. Up to 22222 conditions per place. [2025-01-10 01:09:54,773 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 83 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2025-01-10 01:09:54,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 106 transitions, 959 flow [2025-01-10 01:09:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-01-10 01:09:54,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4512987012987013 [2025-01-10 01:09:54,776 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 797 flow. Second operand 4 states and 139 transitions. [2025-01-10 01:09:54,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 106 transitions, 959 flow [2025-01-10 01:09:54,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 106 transitions, 879 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 01:09:54,804 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 713 flow [2025-01-10 01:09:54,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=713, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2025-01-10 01:09:54,804 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 38 predicate places. [2025-01-10 01:09:54,804 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 713 flow [2025-01-10 01:09:54,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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:09:54,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:54,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:54,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:09:55,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:55,005 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:55,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash 406223408, now seen corresponding path program 1 times [2025-01-10 01:09:55,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:55,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555126091] [2025-01-10 01:09:55,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:55,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:09:55,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:09:55,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:55,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:55,072 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:09:55,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:55,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555126091] [2025-01-10 01:09:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555126091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:55,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:55,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:09:55,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045808137] [2025-01-10 01:09:55,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:55,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:55,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:55,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:55,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:55,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:09:55,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 713 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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:09:55,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:55,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:09:55,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:56,407 INFO L124 PetriNetUnfolderBase]: 12946/20664 cut-off events. [2025-01-10 01:09:56,407 INFO L125 PetriNetUnfolderBase]: For 15808/15808 co-relation queries the response was YES. [2025-01-10 01:09:56,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54654 conditions, 20664 events. 12946/20664 cut-off events. For 15808/15808 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 173192 event pairs, 11717 based on Foata normal form. 0/18841 useless extension candidates. Maximal degree in co-relation 54445. Up to 18088 conditions per place. [2025-01-10 01:09:56,542 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 66 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2025-01-10 01:09:56,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 104 transitions, 870 flow [2025-01-10 01:09:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-01-10 01:09:56,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42077922077922075 [2025-01-10 01:09:56,543 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 713 flow. Second operand 5 states and 162 transitions. [2025-01-10 01:09:56,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 104 transitions, 870 flow [2025-01-10 01:09:56,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 104 transitions, 865 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:56,554 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 733 flow [2025-01-10 01:09:56,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=733, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2025-01-10 01:09:56,555 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2025-01-10 01:09:56,555 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 733 flow [2025-01-10 01:09:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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:09:56,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:56,555 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:09:56,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:09:56,555 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:56,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash 892597491, now seen corresponding path program 1 times [2025-01-10 01:09:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:56,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380433194] [2025-01-10 01:09:56,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:56,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:56,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:09:56,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:09:56,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:56,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:56,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:56,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380433194] [2025-01-10 01:09:56,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380433194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:56,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139508667] [2025-01-10 01:09:56,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:56,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:56,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:56,625 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:09:56,626 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:09:56,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:09:56,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:09:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:56,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:09:56,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:56,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:09:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139508667] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:56,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:09:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966650505] [2025-01-10 01:09:56,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:56,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:09:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:56,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:09:56,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:09:56,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-01-10 01:09:56,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 733 flow. Second operand has 12 states, 12 states have (on average 30.166666666666668) internal successors, (362), 12 states have internal predecessors, (362), 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:09:56,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:56,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-01-10 01:09:56,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:58,255 INFO L124 PetriNetUnfolderBase]: 13171/21594 cut-off events. [2025-01-10 01:09:58,255 INFO L125 PetriNetUnfolderBase]: For 15577/15577 co-relation queries the response was YES. [2025-01-10 01:09:58,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54051 conditions, 21594 events. 13171/21594 cut-off events. For 15577/15577 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 183070 event pairs, 8018 based on Foata normal form. 700/20645 useless extension candidates. Maximal degree in co-relation 53833. Up to 8486 conditions per place. [2025-01-10 01:09:58,421 INFO L140 encePairwiseOnDemand]: 64/77 looper letters, 124 selfloop transitions, 48 changer transitions 0/191 dead transitions. [2025-01-10 01:09:58,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 191 transitions, 1442 flow [2025-01-10 01:09:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:09:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:09:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 479 transitions. [2025-01-10 01:09:58,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183982683982684 [2025-01-10 01:09:58,423 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 733 flow. Second operand 12 states and 479 transitions. [2025-01-10 01:09:58,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 191 transitions, 1442 flow [2025-01-10 01:09:58,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 191 transitions, 1409 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:09:58,437 INFO L231 Difference]: Finished difference. Result has 127 places, 114 transitions, 899 flow [2025-01-10 01:09:58,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=899, PETRI_PLACES=127, PETRI_TRANSITIONS=114} [2025-01-10 01:09:58,437 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 49 predicate places. [2025-01-10 01:09:58,437 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 114 transitions, 899 flow [2025-01-10 01:09:58,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.166666666666668) internal successors, (362), 12 states have internal predecessors, (362), 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:09:58,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:58,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:58,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:09:58,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:58,638 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:09:58,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash -130300020, now seen corresponding path program 1 times [2025-01-10 01:09:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:58,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685412826] [2025-01-10 01:09:58,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:58,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:58,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:09:58,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:09:58,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:58,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:58,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:58,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685412826] [2025-01-10 01:09:58,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685412826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:58,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:58,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:09:58,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9558224] [2025-01-10 01:09:58,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:58,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:58,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:58,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:58,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:58,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-01-10 01:09:58,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 114 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:09:58,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:58,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-01-10 01:09:58,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:59,876 INFO L124 PetriNetUnfolderBase]: 12363/19676 cut-off events. [2025-01-10 01:09:59,876 INFO L125 PetriNetUnfolderBase]: For 19698/19698 co-relation queries the response was YES. [2025-01-10 01:09:59,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52900 conditions, 19676 events. 12363/19676 cut-off events. For 19698/19698 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 151864 event pairs, 4210 based on Foata normal form. 166/18079 useless extension candidates. Maximal degree in co-relation 52648. Up to 11377 conditions per place. [2025-01-10 01:10:00,037 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 115 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2025-01-10 01:10:00,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 136 transitions, 1229 flow [2025-01-10 01:10:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-01-10 01:10:00,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6103896103896104 [2025-01-10 01:10:00,038 INFO L175 Difference]: Start difference. First operand has 127 places, 114 transitions, 899 flow. Second operand 3 states and 141 transitions. [2025-01-10 01:10:00,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 136 transitions, 1229 flow [2025-01-10 01:10:00,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 136 transitions, 1166 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:00,053 INFO L231 Difference]: Finished difference. Result has 124 places, 114 transitions, 852 flow [2025-01-10 01:10:00,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=124, PETRI_TRANSITIONS=114} [2025-01-10 01:10:00,053 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 46 predicate places. [2025-01-10 01:10:00,053 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 114 transitions, 852 flow [2025-01-10 01:10:00,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:10:00,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:00,054 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:00,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:10:00,054 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:10:00,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:00,054 INFO L85 PathProgramCache]: Analyzing trace with hash -920173864, now seen corresponding path program 1 times [2025-01-10 01:10:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:00,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33175863] [2025-01-10 01:10:00,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:00,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:00,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:10:00,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:10:00,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:00,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33175863] [2025-01-10 01:10:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33175863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107804184] [2025-01-10 01:10:00,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:00,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:00,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:00,133 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:10:00,134 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:10:00,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:10:00,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:10:00,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:00,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:00,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:10:00,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:00,252 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:10:00,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:00,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107804184] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:00,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:00,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:10:00,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621732602] [2025-01-10 01:10:00,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:00,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:10:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:00,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:10:00,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:10:00,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-01-10 01:10:00,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 114 transitions, 852 flow. Second operand has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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:10:00,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:00,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-01-10 01:10:00,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:02,552 INFO L124 PetriNetUnfolderBase]: 17577/29091 cut-off events. [2025-01-10 01:10:02,553 INFO L125 PetriNetUnfolderBase]: For 33616/33616 co-relation queries the response was YES. [2025-01-10 01:10:02,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80078 conditions, 29091 events. 17577/29091 cut-off events. For 33616/33616 co-relation queries the response was YES. Maximal size of possible extension queue 1577. Compared 259386 event pairs, 11902 based on Foata normal form. 1016/27671 useless extension candidates. Maximal degree in co-relation 70619. Up to 12673 conditions per place. [2025-01-10 01:10:02,771 INFO L140 encePairwiseOnDemand]: 66/77 looper letters, 161 selfloop transitions, 54 changer transitions 0/234 dead transitions. [2025-01-10 01:10:02,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 234 transitions, 2070 flow [2025-01-10 01:10:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:10:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:10:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 400 transitions. [2025-01-10 01:10:02,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2025-01-10 01:10:02,772 INFO L175 Difference]: Start difference. First operand has 124 places, 114 transitions, 852 flow. Second operand 10 states and 400 transitions. [2025-01-10 01:10:02,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 234 transitions, 2070 flow [2025-01-10 01:10:02,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 234 transitions, 2058 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:02,794 INFO L231 Difference]: Finished difference. Result has 138 places, 140 transitions, 1353 flow [2025-01-10 01:10:02,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1353, PETRI_PLACES=138, PETRI_TRANSITIONS=140} [2025-01-10 01:10:02,795 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 60 predicate places. [2025-01-10 01:10:02,795 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 1353 flow [2025-01-10 01:10:02,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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:10:02,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:02,795 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:10:02,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:10:02,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:02,996 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:10:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash 781870027, now seen corresponding path program 2 times [2025-01-10 01:10:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:02,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336014210] [2025-01-10 01:10:02,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:03,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:10:03,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:10:03,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:03,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:03,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336014210] [2025-01-10 01:10:03,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336014210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:03,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247797765] [2025-01-10 01:10:03,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:03,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:03,123 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:10:03,125 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:10:03,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:10:03,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:10:03,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:03,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:03,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:10:03,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:03,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:03,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247797765] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:03,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:03,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-10 01:10:03,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795619854] [2025-01-10 01:10:03,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:03,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:10:03,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:03,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:10:03,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:10:03,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:10:03,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 1353 flow. Second operand has 16 states, 16 states have (on average 27.0625) internal successors, (433), 16 states have internal predecessors, (433), 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:10:03,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:03,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:10:03,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:10,191 INFO L124 PetriNetUnfolderBase]: 50714/77649 cut-off events. [2025-01-10 01:10:10,192 INFO L125 PetriNetUnfolderBase]: For 86471/87119 co-relation queries the response was YES. [2025-01-10 01:10:10,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217841 conditions, 77649 events. 50714/77649 cut-off events. For 86471/87119 co-relation queries the response was YES. Maximal size of possible extension queue 4130. Compared 697918 event pairs, 26519 based on Foata normal form. 772/73413 useless extension candidates. Maximal degree in co-relation 192648. Up to 26443 conditions per place. [2025-01-10 01:10:10,965 INFO L140 encePairwiseOnDemand]: 63/77 looper letters, 198 selfloop transitions, 85 changer transitions 0/298 dead transitions. [2025-01-10 01:10:10,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 298 transitions, 2637 flow [2025-01-10 01:10:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:10:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:10:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 499 transitions. [2025-01-10 01:10:10,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4985014985014985 [2025-01-10 01:10:10,967 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 1353 flow. Second operand 13 states and 499 transitions. [2025-01-10 01:10:10,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 298 transitions, 2637 flow [2025-01-10 01:10:11,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 298 transitions, 2617 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:11,104 INFO L231 Difference]: Finished difference. Result has 154 places, 154 transitions, 1761 flow [2025-01-10 01:10:11,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1761, PETRI_PLACES=154, PETRI_TRANSITIONS=154} [2025-01-10 01:10:11,104 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 76 predicate places. [2025-01-10 01:10:11,104 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 154 transitions, 1761 flow [2025-01-10 01:10:11,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 27.0625) internal successors, (433), 16 states have internal predecessors, (433), 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:10:11,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:11,105 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:11,244 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:10:11,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 01:10:11,305 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:10:11,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1455742687, now seen corresponding path program 2 times [2025-01-10 01:10:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224733064] [2025-01-10 01:10:11,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:11,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:10:11,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:10:11,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:11,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224733064] [2025-01-10 01:10:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224733064] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889345509] [2025-01-10 01:10:11,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:11,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:11,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:11,441 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:10:11,442 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:10:11,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:10:11,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:10:11,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:11,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:11,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:10:11,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:11,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:11,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889345509] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:11,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:11,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-10 01:10:11,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699414132] [2025-01-10 01:10:11,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:11,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:10:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:11,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:10:11,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:10:11,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:10:11,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 154 transitions, 1761 flow. Second operand has 16 states, 16 states have (on average 27.3125) internal successors, (437), 16 states have internal predecessors, (437), 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:10:11,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:11,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:10:11,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:19,073 INFO L124 PetriNetUnfolderBase]: 49447/72843 cut-off events. [2025-01-10 01:10:19,073 INFO L125 PetriNetUnfolderBase]: For 95355/97095 co-relation queries the response was YES. [2025-01-10 01:10:19,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221374 conditions, 72843 events. 49447/72843 cut-off events. For 95355/97095 co-relation queries the response was YES. Maximal size of possible extension queue 3686. Compared 608399 event pairs, 25518 based on Foata normal form. 888/67727 useless extension candidates. Maximal degree in co-relation 197156. Up to 30632 conditions per place. [2025-01-10 01:10:19,830 INFO L140 encePairwiseOnDemand]: 63/77 looper letters, 184 selfloop transitions, 85 changer transitions 0/285 dead transitions. [2025-01-10 01:10:19,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 285 transitions, 2840 flow [2025-01-10 01:10:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:10:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:10:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 487 transitions. [2025-01-10 01:10:19,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4865134865134865 [2025-01-10 01:10:19,831 INFO L175 Difference]: Start difference. First operand has 154 places, 154 transitions, 1761 flow. Second operand 13 states and 487 transitions. [2025-01-10 01:10:19,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 285 transitions, 2840 flow [2025-01-10 01:10:19,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 285 transitions, 2803 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:19,920 INFO L231 Difference]: Finished difference. Result has 167 places, 158 transitions, 1986 flow [2025-01-10 01:10:19,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1986, PETRI_PLACES=167, PETRI_TRANSITIONS=158} [2025-01-10 01:10:19,920 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 89 predicate places. [2025-01-10 01:10:19,920 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 158 transitions, 1986 flow [2025-01-10 01:10:19,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 27.3125) internal successors, (437), 16 states have internal predecessors, (437), 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:10:19,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:19,920 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:19,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:20,121 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,SelfDestructingSolverStorable23 [2025-01-10 01:10:20,121 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:10:20,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash 970328700, now seen corresponding path program 3 times [2025-01-10 01:10:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613220947] [2025-01-10 01:10:20,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:10:20,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:20,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-01-10 01:10:20,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 21 statements. [2025-01-10 01:10:20,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:10:20,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:10:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613220947] [2025-01-10 01:10:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613220947] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684007516] [2025-01-10 01:10:20,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:10:20,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:20,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:20,488 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:10:20,489 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:10:20,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-01-10 01:10:20,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 21 statements. [2025-01-10 01:10:20,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:10:20,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:20,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 01:10:20,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:20,644 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:10:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:10:20,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:10:21,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684007516] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:21,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:21,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-01-10 01:10:21,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298372323] [2025-01-10 01:10:21,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:21,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:10:21,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:21,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:10:21,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:10:21,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-01-10 01:10:21,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 158 transitions, 1986 flow. Second operand has 23 states, 23 states have (on average 27.217391304347824) internal successors, (626), 23 states have internal predecessors, (626), 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:10:21,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:21,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-01-10 01:10:21,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand