./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/array-eq-trans.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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:59:27,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:59:27,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:59:27,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:59:27,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:59:27,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:59:27,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:59:27,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:59:27,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:59:27,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:59:27,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:59:27,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:59:27,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:59:27,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:59:27,567 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:59:27,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:59:27,567 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:59:27,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:59:27,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:59:27,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:59:27,567 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:59:27,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:59:27,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:59:27,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:59:27,568 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-02-06 12:59:27,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:59:27,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:59:27,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:59:27,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:59:27,911 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:59:27,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-02-06 12:59:29,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ffaf7c74/a3bed6406d4640f5a25761792e00c41b/FLAG86be2b15e [2025-02-06 12:59:29,514 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:59:29,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-02-06 12:59:29,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ffaf7c74/a3bed6406d4640f5a25761792e00c41b/FLAG86be2b15e [2025-02-06 12:59:29,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ffaf7c74/a3bed6406d4640f5a25761792e00c41b [2025-02-06 12:59:29,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:59:29,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:59:29,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:59:29,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:59:29,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:59:29,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:59:29" (1/1) ... [2025-02-06 12:59:29,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b504c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:29, skipping insertion in model container [2025-02-06 12:59:29,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:59:29" (1/1) ... [2025-02-06 12:59:29,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:59:29,956 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:59:29,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:59:29,972 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:59:29,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:59:30,007 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:59:30,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30 WrapperNode [2025-02-06 12:59:30,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:59:30,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:59:30,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:59:30,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:59:30,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,043 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 187 [2025-02-06 12:59:30,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:59:30,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:59:30,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:59:30,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:59:30,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,077 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 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-02-06 12:59:30,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:59:30,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:59:30,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:59:30,089 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:59:30,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (1/1) ... [2025-02-06 12:59:30,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:59:30,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:59:30,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:59:30,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:59:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 12:59:30,145 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 12:59:30,145 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 12:59:30,145 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:59:30,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:59:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:59:30,146 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:59:30,214 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:59:30,215 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:59:30,787 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:59:30,787 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:59:31,078 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:59:31,078 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:59:31,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:59:31 BoogieIcfgContainer [2025-02-06 12:59:31,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:59:31,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:59:31,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:59:31,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:59:31,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:59:29" (1/3) ... [2025-02-06 12:59:31,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b27bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:59:31, skipping insertion in model container [2025-02-06 12:59:31,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:59:30" (2/3) ... [2025-02-06 12:59:31,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b27bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:59:31, skipping insertion in model container [2025-02-06 12:59:31,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:59:31" (3/3) ... [2025-02-06 12:59:31,087 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-02-06 12:59:31,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:59:31,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 91 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-02-06 12:59:31,100 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:59:31,147 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 12:59:31,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 231 flow [2025-02-06 12:59:31,205 INFO L124 PetriNetUnfolderBase]: 15/102 cut-off events. [2025-02-06 12:59:31,206 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 12:59:31,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 15/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 273 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-02-06 12:59:31,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 105 transitions, 231 flow [2025-02-06 12:59:31,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 101 transitions, 220 flow [2025-02-06 12:59:31,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:59:31,230 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;@547de6a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:59:31,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-02-06 12:59:31,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:59:31,233 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 12:59:31,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:59:31,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:31,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:59:31,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:31,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash 672057, now seen corresponding path program 1 times [2025-02-06 12:59:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:31,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134308608] [2025-02-06 12:59:31,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:31,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:59:31,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:59:31,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:31,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134308608] [2025-02-06 12:59:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134308608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:59:31,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:59:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:59:31,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938501888] [2025-02-06 12:59:31,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:59:31,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:59:31,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:31,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:59:31,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:59:31,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-06 12:59:31,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:31,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:31,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-06 12:59:31,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:31,933 INFO L124 PetriNetUnfolderBase]: 534/1059 cut-off events. [2025-02-06 12:59:31,933 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-06 12:59:31,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 1059 events. 534/1059 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6200 event pairs, 210 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 1547. Up to 662 conditions per place. [2025-02-06 12:59:31,951 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 35 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-02-06 12:59:31,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 284 flow [2025-02-06 12:59:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:59:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:59:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2025-02-06 12:59:31,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2025-02-06 12:59:31,967 INFO L175 Difference]: Start difference. First operand has 96 places, 101 transitions, 220 flow. Second operand 3 states and 230 transitions. [2025-02-06 12:59:31,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 284 flow [2025-02-06 12:59:31,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 96 transitions, 272 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 12:59:31,975 INFO L231 Difference]: Finished difference. Result has 87 places, 96 transitions, 202 flow [2025-02-06 12:59:31,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=87, PETRI_TRANSITIONS=96} [2025-02-06 12:59:31,981 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -9 predicate places. [2025-02-06 12:59:31,981 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 202 flow [2025-02-06 12:59:31,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:31,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:31,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:59:31,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:59:31,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash 672058, now seen corresponding path program 1 times [2025-02-06 12:59:31,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:31,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669206486] [2025-02-06 12:59:31,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:31,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:59:32,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:59:32,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:32,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:32,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:32,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669206486] [2025-02-06 12:59:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669206486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:59:32,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:59:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:59:32,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364924334] [2025-02-06 12:59:32,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:59:32,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:59:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:32,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:59:32,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:59:32,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-06 12:59:32,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:32,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:32,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-06 12:59:32,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:32,789 INFO L124 PetriNetUnfolderBase]: 535/1062 cut-off events. [2025-02-06 12:59:32,790 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 12:59:32,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 1062 events. 535/1062 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6219 event pairs, 210 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 1727. Up to 675 conditions per place. [2025-02-06 12:59:32,806 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 39 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2025-02-06 12:59:32,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 99 transitions, 294 flow [2025-02-06 12:59:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:59:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:59:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 296 transitions. [2025-02-06 12:59:32,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-02-06 12:59:32,812 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 202 flow. Second operand 4 states and 296 transitions. [2025-02-06 12:59:32,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 99 transitions, 294 flow [2025-02-06 12:59:32,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 99 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:59:32,815 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 225 flow [2025-02-06 12:59:32,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=90, PETRI_TRANSITIONS=99} [2025-02-06 12:59:32,819 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -6 predicate places. [2025-02-06 12:59:32,819 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 225 flow [2025-02-06 12:59:32,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:32,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:32,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:59:32,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:59:32,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:32,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash 20833324, now seen corresponding path program 1 times [2025-02-06 12:59:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:32,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39922272] [2025-02-06 12:59:32,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:32,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:59:32,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:59:32,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:32,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:32,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:32,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39922272] [2025-02-06 12:59:32,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39922272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:59:32,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:59:32,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:59:32,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793117388] [2025-02-06 12:59:32,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:59:32,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:59:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:32,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:59:32,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:59:33,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-06 12:59:33,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:33,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:33,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-06 12:59:33,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:33,289 INFO L124 PetriNetUnfolderBase]: 536/1065 cut-off events. [2025-02-06 12:59:33,290 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 12:59:33,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1065 events. 536/1065 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6230 event pairs, 210 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 1756. Up to 674 conditions per place. [2025-02-06 12:59:33,298 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 39 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-02-06 12:59:33,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 323 flow [2025-02-06 12:59:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:59:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:59:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2025-02-06 12:59:33,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6895238095238095 [2025-02-06 12:59:33,302 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 225 flow. Second operand 5 states and 362 transitions. [2025-02-06 12:59:33,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 323 flow [2025-02-06 12:59:33,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:59:33,304 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 259 flow [2025-02-06 12:59:33,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-02-06 12:59:33,305 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2025-02-06 12:59:33,305 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 259 flow [2025-02-06 12:59:33,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:33,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:33,305 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 12:59:33,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:59:33,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:33,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash 645867277, now seen corresponding path program 1 times [2025-02-06 12:59:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:33,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457480794] [2025-02-06 12:59:33,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:33,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:59:33,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:59:33,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:33,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:33,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:33,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457480794] [2025-02-06 12:59:33,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457480794] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:59:33,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581087934] [2025-02-06 12:59:33,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:33,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:59:33,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:59:33,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:59:33,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:59:33,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:59:33,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:59:33,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:33,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:33,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 12:59:33,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:59:33,582 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-02-06 12:59:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:33,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:59:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:33,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581087934] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:59:33,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:59:33,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 12:59:33,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420005535] [2025-02-06 12:59:33,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:59:33,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:59:33,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:33,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:59:33,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:59:34,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-06 12:59:34,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 259 flow. Second operand has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:34,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:34,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-06 12:59:34,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:34,469 INFO L124 PetriNetUnfolderBase]: 536/1064 cut-off events. [2025-02-06 12:59:34,469 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 12:59:34,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 1064 events. 536/1064 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6252 event pairs, 210 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 1766. Up to 674 conditions per place. [2025-02-06 12:59:34,476 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 38 selfloop transitions, 7 changer transitions 0/101 dead transitions. [2025-02-06 12:59:34,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 101 transitions, 345 flow [2025-02-06 12:59:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:59:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:59:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 421 transitions. [2025-02-06 12:59:34,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6682539682539682 [2025-02-06 12:59:34,478 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 259 flow. Second operand 6 states and 421 transitions. [2025-02-06 12:59:34,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 101 transitions, 345 flow [2025-02-06 12:59:34,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 101 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:59:34,480 INFO L231 Difference]: Finished difference. Result has 98 places, 101 transitions, 268 flow [2025-02-06 12:59:34,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=98, PETRI_TRANSITIONS=101} [2025-02-06 12:59:34,481 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 2 predicate places. [2025-02-06 12:59:34,481 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 101 transitions, 268 flow [2025-02-06 12:59:34,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:34,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:34,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:59:34,488 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-02-06 12:59:34,682 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-02-06 12:59:34,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 645835800, now seen corresponding path program 1 times [2025-02-06 12:59:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40187121] [2025-02-06 12:59:34,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:34,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:59:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:59:34,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:34,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:34,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40187121] [2025-02-06 12:59:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40187121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:59:34,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:59:34,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:59:34,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893050377] [2025-02-06 12:59:34,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:59:34,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:59:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:34,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:59:34,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:59:34,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-06 12:59:34,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:34,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:34,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-06 12:59:34,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:35,059 INFO L124 PetriNetUnfolderBase]: 537/1067 cut-off events. [2025-02-06 12:59:35,060 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 12:59:35,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 1067 events. 537/1067 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6266 event pairs, 210 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1774. Up to 676 conditions per place. [2025-02-06 12:59:35,067 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 39 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2025-02-06 12:59:35,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 370 flow [2025-02-06 12:59:35,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:59:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:59:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2025-02-06 12:59:35,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6876190476190476 [2025-02-06 12:59:35,068 INFO L175 Difference]: Start difference. First operand has 98 places, 101 transitions, 268 flow. Second operand 5 states and 361 transitions. [2025-02-06 12:59:35,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 370 flow [2025-02-06 12:59:35,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 104 transitions, 336 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-02-06 12:59:35,070 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 277 flow [2025-02-06 12:59:35,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2025-02-06 12:59:35,071 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 0 predicate places. [2025-02-06 12:59:35,071 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 277 flow [2025-02-06 12:59:35,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:35,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:35,072 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 12:59:35,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:59:35,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:35,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:35,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1453992130, now seen corresponding path program 1 times [2025-02-06 12:59:35,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:35,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948724954] [2025-02-06 12:59:35,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:35,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:35,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:59:35,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:59:35,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:35,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:35,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:35,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948724954] [2025-02-06 12:59:35,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948724954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:59:35,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407673455] [2025-02-06 12:59:35,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:35,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:59:35,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:59:35,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:59:35,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:59:35,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:59:35,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:59:35,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:35,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:35,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 12:59:35,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:59:35,355 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-02-06 12:59:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:35,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:59:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:35,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407673455] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:59:35,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:59:35,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-06 12:59:35,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715098014] [2025-02-06 12:59:35,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:59:35,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:59:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:35,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:59:35,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:59:36,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-06 12:59:36,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 277 flow. Second operand has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:36,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:36,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-06 12:59:36,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:37,150 INFO L124 PetriNetUnfolderBase]: 537/1066 cut-off events. [2025-02-06 12:59:37,150 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-06 12:59:37,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 1066 events. 537/1066 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6205 event pairs, 210 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 1763. Up to 669 conditions per place. [2025-02-06 12:59:37,169 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 35 selfloop transitions, 12 changer transitions 0/103 dead transitions. [2025-02-06 12:59:37,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 103 transitions, 367 flow [2025-02-06 12:59:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:59:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:59:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 486 transitions. [2025-02-06 12:59:37,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612244897959184 [2025-02-06 12:59:37,171 INFO L175 Difference]: Start difference. First operand has 96 places, 104 transitions, 277 flow. Second operand 7 states and 486 transitions. [2025-02-06 12:59:37,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 103 transitions, 367 flow [2025-02-06 12:59:37,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 103 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:59:37,173 INFO L231 Difference]: Finished difference. Result has 99 places, 103 transitions, 290 flow [2025-02-06 12:59:37,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2025-02-06 12:59:37,179 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 3 predicate places. [2025-02-06 12:59:37,180 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 103 transitions, 290 flow [2025-02-06 12:59:37,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:37,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:37,180 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 12:59:37,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:59:37,381 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-02-06 12:59:37,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:37,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2122032423, now seen corresponding path program 1 times [2025-02-06 12:59:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:37,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655016193] [2025-02-06 12:59:37,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:37,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:59:37,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:59:37,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:37,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655016193] [2025-02-06 12:59:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655016193] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:59:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72574805] [2025-02-06 12:59:37,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:37,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:59:37,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:59:37,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:59:37,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:59:37,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:59:37,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:59:37,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:37,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:37,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 12:59:37,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:59:37,876 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-02-06 12:59:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:37,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:59:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:38,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72574805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:59:38,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:59:38,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-06 12:59:38,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511869069] [2025-02-06 12:59:38,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:59:38,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:59:38,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:38,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:59:38,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:59:38,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-06 12:59:38,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 103 transitions, 290 flow. Second operand has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:38,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:38,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-06 12:59:38,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:39,045 INFO L124 PetriNetUnfolderBase]: 539/1071 cut-off events. [2025-02-06 12:59:39,046 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 12:59:39,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 1071 events. 539/1071 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6274 event pairs, 210 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 1768. Up to 670 conditions per place. [2025-02-06 12:59:39,053 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 31 selfloop transitions, 21 changer transitions 0/108 dead transitions. [2025-02-06 12:59:39,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 416 flow [2025-02-06 12:59:39,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:59:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:59:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 618 transitions. [2025-02-06 12:59:39,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.653968253968254 [2025-02-06 12:59:39,057 INFO L175 Difference]: Start difference. First operand has 99 places, 103 transitions, 290 flow. Second operand 9 states and 618 transitions. [2025-02-06 12:59:39,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 416 flow [2025-02-06 12:59:39,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 108 transitions, 389 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-06 12:59:39,060 INFO L231 Difference]: Finished difference. Result has 101 places, 108 transitions, 327 flow [2025-02-06 12:59:39,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=101, PETRI_TRANSITIONS=108} [2025-02-06 12:59:39,062 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-02-06 12:59:39,063 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 108 transitions, 327 flow [2025-02-06 12:59:39,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:39,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:39,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:59:39,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:59:39,264 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-02-06 12:59:39,265 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:39,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1354099825, now seen corresponding path program 1 times [2025-02-06 12:59:39,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:39,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683197107] [2025-02-06 12:59:39,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:39,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:59:39,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:59:39,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:39,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:39,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683197107] [2025-02-06 12:59:39,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683197107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:59:39,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:59:39,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:59:39,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110349663] [2025-02-06 12:59:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:59:39,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:59:39,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:39,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:59:39,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:59:39,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-06 12:59:39,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 108 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:39,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:39,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-06 12:59:39,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:39,536 INFO L124 PetriNetUnfolderBase]: 847/1773 cut-off events. [2025-02-06 12:59:39,536 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 12:59:39,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3006 conditions, 1773 events. 847/1773 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11872 event pairs, 368 based on Foata normal form. 32/1034 useless extension candidates. Maximal degree in co-relation 2055. Up to 781 conditions per place. [2025-02-06 12:59:39,550 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 86 selfloop transitions, 7 changer transitions 0/148 dead transitions. [2025-02-06 12:59:39,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 148 transitions, 657 flow [2025-02-06 12:59:39,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:59:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:59:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2025-02-06 12:59:39,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7695238095238095 [2025-02-06 12:59:39,553 INFO L175 Difference]: Start difference. First operand has 101 places, 108 transitions, 327 flow. Second operand 5 states and 404 transitions. [2025-02-06 12:59:39,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 148 transitions, 657 flow [2025-02-06 12:59:39,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 148 transitions, 585 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-02-06 12:59:39,557 INFO L231 Difference]: Finished difference. Result has 101 places, 112 transitions, 333 flow [2025-02-06 12:59:39,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=101, PETRI_TRANSITIONS=112} [2025-02-06 12:59:39,558 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-02-06 12:59:39,558 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 112 transitions, 333 flow [2025-02-06 12:59:39,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:39,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:39,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:59:39,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:59:39,560 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash 43778728, now seen corresponding path program 1 times [2025-02-06 12:59:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:39,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337114659] [2025-02-06 12:59:39,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:39,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:59:39,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:59:39,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:39,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337114659] [2025-02-06 12:59:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337114659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:59:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:59:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:59:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930099457] [2025-02-06 12:59:39,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:59:39,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:59:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:39,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:59:39,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:59:39,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-06 12:59:39,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 112 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:39,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:39,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-06 12:59:39,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:39,855 INFO L124 PetriNetUnfolderBase]: 1192/2550 cut-off events. [2025-02-06 12:59:39,855 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 12:59:39,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4310 conditions, 2550 events. 1192/2550 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18731 event pairs, 554 based on Foata normal form. 50/1577 useless extension candidates. Maximal degree in co-relation 2882. Up to 1164 conditions per place. [2025-02-06 12:59:39,865 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 86 selfloop transitions, 7 changer transitions 0/148 dead transitions. [2025-02-06 12:59:39,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 148 transitions, 627 flow [2025-02-06 12:59:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:59:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:59:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 395 transitions. [2025-02-06 12:59:39,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2025-02-06 12:59:39,867 INFO L175 Difference]: Start difference. First operand has 101 places, 112 transitions, 333 flow. Second operand 5 states and 395 transitions. [2025-02-06 12:59:39,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 148 transitions, 627 flow [2025-02-06 12:59:39,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 148 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:59:39,869 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 345 flow [2025-02-06 12:59:39,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=345, PETRI_PLACES=104, PETRI_TRANSITIONS=112} [2025-02-06 12:59:39,870 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2025-02-06 12:59:39,871 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 345 flow [2025-02-06 12:59:39,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:39,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:39,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:59:39,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:59:39,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:39,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:39,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1624581731, now seen corresponding path program 1 times [2025-02-06 12:59:39,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:39,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071635116] [2025-02-06 12:59:39,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:39,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:59:39,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:59:39,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:39,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 12:59:39,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:39,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071635116] [2025-02-06 12:59:39,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071635116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:59:39,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:59:39,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:59:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337808350] [2025-02-06 12:59:39,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:59:39,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:59:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:39,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:59:39,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:59:39,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-06 12:59:39,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:39,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:39,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-06 12:59:39,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:40,249 INFO L124 PetriNetUnfolderBase]: 1469/3108 cut-off events. [2025-02-06 12:59:40,249 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-02-06 12:59:40,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5316 conditions, 3108 events. 1469/3108 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23209 event pairs, 431 based on Foata normal form. 18/1891 useless extension candidates. Maximal degree in co-relation 3550. Up to 943 conditions per place. [2025-02-06 12:59:40,260 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 110 selfloop transitions, 8 changer transitions 0/173 dead transitions. [2025-02-06 12:59:40,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 173 transitions, 746 flow [2025-02-06 12:59:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:59:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:59:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2025-02-06 12:59:40,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-02-06 12:59:40,262 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 345 flow. Second operand 5 states and 420 transitions. [2025-02-06 12:59:40,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 173 transitions, 746 flow [2025-02-06 12:59:40,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 173 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:59:40,265 INFO L231 Difference]: Finished difference. Result has 108 places, 113 transitions, 368 flow [2025-02-06 12:59:40,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=108, PETRI_TRANSITIONS=113} [2025-02-06 12:59:40,266 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2025-02-06 12:59:40,267 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 113 transitions, 368 flow [2025-02-06 12:59:40,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:40,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:40,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:59:40,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:59:40,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:40,268 INFO L85 PathProgramCache]: Analyzing trace with hash -913468783, now seen corresponding path program 1 times [2025-02-06 12:59:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:40,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543108331] [2025-02-06 12:59:40,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:40,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:40,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:59:40,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:59:40,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:40,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:59:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543108331] [2025-02-06 12:59:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543108331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:59:40,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:59:40,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:59:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152004808] [2025-02-06 12:59:40,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:59:40,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:59:40,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:40,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:59:40,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:59:40,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-06 12:59:40,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 113 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:40,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:40,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-06 12:59:40,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:40,539 INFO L124 PetriNetUnfolderBase]: 1209/2262 cut-off events. [2025-02-06 12:59:40,540 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-02-06 12:59:40,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4231 conditions, 2262 events. 1209/2262 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14761 event pairs, 625 based on Foata normal form. 20/1637 useless extension candidates. Maximal degree in co-relation 3004. Up to 1396 conditions per place. [2025-02-06 12:59:40,551 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 85 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2025-02-06 12:59:40,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 147 transitions, 653 flow [2025-02-06 12:59:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:59:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:59:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2025-02-06 12:59:40,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7657142857142857 [2025-02-06 12:59:40,553 INFO L175 Difference]: Start difference. First operand has 108 places, 113 transitions, 368 flow. Second operand 5 states and 402 transitions. [2025-02-06 12:59:40,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 147 transitions, 653 flow [2025-02-06 12:59:40,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 147 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:59:40,557 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 380 flow [2025-02-06 12:59:40,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2025-02-06 12:59:40,557 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2025-02-06 12:59:40,557 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 380 flow [2025-02-06 12:59:40,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:40,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:40,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:59:40,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:59:40,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:40,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1071767610, now seen corresponding path program 1 times [2025-02-06 12:59:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240880842] [2025-02-06 12:59:40,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:40,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:59:40,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:59:40,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:40,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:59:40,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240880842] [2025-02-06 12:59:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240880842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:59:40,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:59:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:59:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788413775] [2025-02-06 12:59:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:59:40,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:59:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:40,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:59:40,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:59:40,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-06 12:59:40,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:40,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:40,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-06 12:59:40,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:40,916 INFO L124 PetriNetUnfolderBase]: 1657/3705 cut-off events. [2025-02-06 12:59:40,917 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-02-06 12:59:40,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6643 conditions, 3705 events. 1657/3705 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 29723 event pairs, 891 based on Foata normal form. 62/2658 useless extension candidates. Maximal degree in co-relation 5411. Up to 1627 conditions per place. [2025-02-06 12:59:40,932 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 76 selfloop transitions, 8 changer transitions 0/139 dead transitions. [2025-02-06 12:59:40,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 139 transitions, 610 flow [2025-02-06 12:59:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:59:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:59:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2025-02-06 12:59:40,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7466666666666667 [2025-02-06 12:59:40,934 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 380 flow. Second operand 5 states and 392 transitions. [2025-02-06 12:59:40,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 139 transitions, 610 flow [2025-02-06 12:59:40,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 139 transitions, 596 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:59:40,936 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 386 flow [2025-02-06 12:59:40,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-02-06 12:59:40,937 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 16 predicate places. [2025-02-06 12:59:40,937 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 386 flow [2025-02-06 12:59:40,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:40,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:40,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:59:40,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:59:40,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:40,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1341498479, now seen corresponding path program 1 times [2025-02-06 12:59:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:40,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741957464] [2025-02-06 12:59:40,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:40,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:59:40,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:59:40,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:40,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 12:59:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741957464] [2025-02-06 12:59:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741957464] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:59:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134421620] [2025-02-06 12:59:41,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:41,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:59:41,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:59:41,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:59:41,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:59:41,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:59:41,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:59:41,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:41,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:41,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:59:41,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:59:41,250 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-02-06 12:59:41,383 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:59:41,383 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-02-06 12:59:41,394 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-02-06 12:59:41,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:59:41,482 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-02-06 12:59:41,498 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:59:41,498 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-02-06 12:59:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 12:59:41,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:59:41,897 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 189 treesize of output 183 [2025-02-06 12:59:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 12:59:42,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134421620] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:59:42,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:59:42,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-06 12:59:42,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720002049] [2025-02-06 12:59:42,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:59:42,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:59:42,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:42,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:59:42,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:59:44,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-02-06 12:59:44,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 386 flow. Second operand has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:44,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:59:44,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-02-06 12:59:44,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:59:45,672 INFO L124 PetriNetUnfolderBase]: 3143/5923 cut-off events. [2025-02-06 12:59:45,673 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-02-06 12:59:45,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10947 conditions, 5923 events. 3143/5923 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 45852 event pairs, 1276 based on Foata normal form. 0/4310 useless extension candidates. Maximal degree in co-relation 8711. Up to 1763 conditions per place. [2025-02-06 12:59:45,695 INFO L140 encePairwiseOnDemand]: 89/105 looper letters, 117 selfloop transitions, 20 changer transitions 0/183 dead transitions. [2025-02-06 12:59:45,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 183 transitions, 839 flow [2025-02-06 12:59:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:59:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:59:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 559 transitions. [2025-02-06 12:59:45,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6654761904761904 [2025-02-06 12:59:45,698 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 386 flow. Second operand 8 states and 559 transitions. [2025-02-06 12:59:45,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 183 transitions, 839 flow [2025-02-06 12:59:45,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:59:45,702 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 462 flow [2025-02-06 12:59:45,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=462, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2025-02-06 12:59:45,703 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 24 predicate places. [2025-02-06 12:59:45,703 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 462 flow [2025-02-06 12:59:45,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:59:45,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:59:45,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:59:45,710 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-02-06 12:59:45,903 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-02-06 12:59:45,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 12:59:45,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:59:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1363219500, now seen corresponding path program 1 times [2025-02-06 12:59:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:59:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390672792] [2025-02-06 12:59:45,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:59:45,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:59:45,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:59:45,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:45,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 12:59:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:59:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390672792] [2025-02-06 12:59:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390672792] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:59:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333659640] [2025-02-06 12:59:46,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:59:46,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:59:46,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:59:46,070 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:59:46,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:59:46,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:59:46,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:59:46,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:59:46,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:59:46,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:59:46,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:59:46,138 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-02-06 12:59:46,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:59:46,194 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-02-06 12:59:46,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:59:46,206 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-02-06 12:59:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 12:59:46,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:59:46,408 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 61 treesize of output 57 [2025-02-06 12:59:46,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:59:46,486 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 34 treesize of output 39 [2025-02-06 12:59:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 12:59:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333659640] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:59:46,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:59:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-06 12:59:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585438412] [2025-02-06 12:59:46,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:59:46,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:59:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:59:46,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:59:46,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:59:50,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:59:54,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:59:58,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:02,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:06,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:10,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:15,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:19,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:23,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:27,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:31,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:31,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-02-06 13:00:31,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 117 transitions, 462 flow. Second operand has 12 states, 12 states have (on average 51.0) internal successors, (612), 12 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:31,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:00:31,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-02-06 13:00:31,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:00:31,886 INFO L124 PetriNetUnfolderBase]: 5275/8733 cut-off events. [2025-02-06 13:00:31,886 INFO L125 PetriNetUnfolderBase]: For 1459/1483 co-relation queries the response was YES. [2025-02-06 13:00:31,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17800 conditions, 8733 events. 5275/8733 cut-off events. For 1459/1483 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 63319 event pairs, 1236 based on Foata normal form. 8/6662 useless extension candidates. Maximal degree in co-relation 15171. Up to 2457 conditions per place. [2025-02-06 13:00:31,922 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 168 selfloop transitions, 29 changer transitions 0/241 dead transitions. [2025-02-06 13:00:31,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 241 transitions, 1192 flow [2025-02-06 13:00:31,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:00:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:00:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 671 transitions. [2025-02-06 13:00:31,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6390476190476191 [2025-02-06 13:00:31,924 INFO L175 Difference]: Start difference. First operand has 120 places, 117 transitions, 462 flow. Second operand 10 states and 671 transitions. [2025-02-06 13:00:31,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 241 transitions, 1192 flow [2025-02-06 13:00:31,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 241 transitions, 1165 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-06 13:00:31,930 INFO L231 Difference]: Finished difference. Result has 131 places, 128 transitions, 603 flow [2025-02-06 13:00:31,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=603, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2025-02-06 13:00:31,931 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 35 predicate places. [2025-02-06 13:00:31,931 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 603 flow [2025-02-06 13:00:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 51.0) internal successors, (612), 12 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:31,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:00:31,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:00:31,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:00:32,132 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-02-06 13:00:32,132 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 13:00:32,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:00:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1363219501, now seen corresponding path program 1 times [2025-02-06 13:00:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:00:32,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762240767] [2025-02-06 13:00:32,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:00:32,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:00:32,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:00:32,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:00:32,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:00:32,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:00:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 13:00:32,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:00:32,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762240767] [2025-02-06 13:00:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762240767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:00:32,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:00:32,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:00:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520394404] [2025-02-06 13:00:32,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:00:32,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:00:32,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:00:32,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:00:32,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:00:32,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 105 [2025-02-06 13:00:32,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:32,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:00:32,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 105 [2025-02-06 13:00:32,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:00:32,550 INFO L124 PetriNetUnfolderBase]: 2648/5215 cut-off events. [2025-02-06 13:00:32,550 INFO L125 PetriNetUnfolderBase]: For 2015/2015 co-relation queries the response was YES. [2025-02-06 13:00:32,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10737 conditions, 5215 events. 2648/5215 cut-off events. For 2015/2015 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 39826 event pairs, 1496 based on Foata normal form. 144/4263 useless extension candidates. Maximal degree in co-relation 9281. Up to 3556 conditions per place. [2025-02-06 13:00:32,576 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 57 selfloop transitions, 16 changer transitions 0/124 dead transitions. [2025-02-06 13:00:32,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 741 flow [2025-02-06 13:00:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:00:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:00:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 324 transitions. [2025-02-06 13:00:32,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-02-06 13:00:32,577 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 603 flow. Second operand 5 states and 324 transitions. [2025-02-06 13:00:32,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 741 flow [2025-02-06 13:00:32,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 124 transitions, 722 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 13:00:32,585 INFO L231 Difference]: Finished difference. Result has 128 places, 124 transitions, 608 flow [2025-02-06 13:00:32,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=608, PETRI_PLACES=128, PETRI_TRANSITIONS=124} [2025-02-06 13:00:32,585 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 32 predicate places. [2025-02-06 13:00:32,585 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 124 transitions, 608 flow [2025-02-06 13:00:32,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:32,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:00:32,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:00:32,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:00:32,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 13:00:32,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:00:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -91282022, now seen corresponding path program 1 times [2025-02-06 13:00:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:00:32,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789156365] [2025-02-06 13:00:32,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:00:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:00:32,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:00:32,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:00:32,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:00:32,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:00:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:00:32,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:00:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789156365] [2025-02-06 13:00:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789156365] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:00:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020959629] [2025-02-06 13:00:32,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:00:32,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:00:32,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:00:32,724 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-02-06 13:00:32,725 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-02-06 13:00:32,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:00:32,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:00:32,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:00:32,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:00:32,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:00:32,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:00:32,792 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-02-06 13:00:32,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:00:32,829 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-02-06 13:00:32,834 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:00:32,834 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-02-06 13:00:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:00:32,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:00:32,948 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 61 treesize of output 57 [2025-02-06 13:00:33,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:00:33,031 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 34 treesize of output 39 [2025-02-06 13:00:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:00:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020959629] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:00:33,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:00:33,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-06 13:00:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854914549] [2025-02-06 13:00:33,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:00:33,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:00:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:00:33,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:00:33,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:00:33,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 105 [2025-02-06 13:00:33,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 124 transitions, 608 flow. Second operand has 12 states, 12 states have (on average 61.833333333333336) internal successors, (742), 12 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:33,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:00:33,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 105 [2025-02-06 13:00:33,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:00:34,346 INFO L124 PetriNetUnfolderBase]: 3389/6971 cut-off events. [2025-02-06 13:00:34,347 INFO L125 PetriNetUnfolderBase]: For 3763/4078 co-relation queries the response was YES. [2025-02-06 13:00:34,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13581 conditions, 6971 events. 3389/6971 cut-off events. For 3763/4078 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 57765 event pairs, 985 based on Foata normal form. 0/5227 useless extension candidates. Maximal degree in co-relation 11873. Up to 1934 conditions per place. [2025-02-06 13:00:34,378 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 129 selfloop transitions, 29 changer transitions 0/209 dead transitions. [2025-02-06 13:00:34,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 209 transitions, 1164 flow [2025-02-06 13:00:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:00:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:00:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 726 transitions. [2025-02-06 13:00:34,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2025-02-06 13:00:34,380 INFO L175 Difference]: Start difference. First operand has 128 places, 124 transitions, 608 flow. Second operand 10 states and 726 transitions. [2025-02-06 13:00:34,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 209 transitions, 1164 flow [2025-02-06 13:00:34,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 209 transitions, 1144 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:00:34,385 INFO L231 Difference]: Finished difference. Result has 138 places, 128 transitions, 688 flow [2025-02-06 13:00:34,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=688, PETRI_PLACES=138, PETRI_TRANSITIONS=128} [2025-02-06 13:00:34,385 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 42 predicate places. [2025-02-06 13:00:34,385 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 128 transitions, 688 flow [2025-02-06 13:00:34,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 61.833333333333336) internal successors, (742), 12 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:34,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:00:34,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:00:34,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:00:34,586 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,SelfDestructingSolverStorable15 [2025-02-06 13:00:34,587 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 13:00:34,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:00:34,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1336767970, now seen corresponding path program 1 times [2025-02-06 13:00:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:00:34,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341824849] [2025-02-06 13:00:34,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:00:34,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:00:34,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:00:34,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:00:34,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:00:34,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:00:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:00:34,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:00:34,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341824849] [2025-02-06 13:00:34,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341824849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:00:34,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:00:34,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:00:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136207422] [2025-02-06 13:00:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:00:34,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:00:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:00:34,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:00:34,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:00:34,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-06 13:00:34,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 128 transitions, 688 flow. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:34,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:00:34,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-06 13:00:34,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:00:35,155 INFO L124 PetriNetUnfolderBase]: 3492/7667 cut-off events. [2025-02-06 13:00:35,155 INFO L125 PetriNetUnfolderBase]: For 5114/5558 co-relation queries the response was YES. [2025-02-06 13:00:35,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15436 conditions, 7667 events. 3492/7667 cut-off events. For 5114/5558 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 67511 event pairs, 1481 based on Foata normal form. 30/6154 useless extension candidates. Maximal degree in co-relation 13581. Up to 2650 conditions per place. [2025-02-06 13:00:35,178 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 111 selfloop transitions, 13 changer transitions 0/181 dead transitions. [2025-02-06 13:00:35,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 181 transitions, 1113 flow [2025-02-06 13:00:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:00:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:00:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2025-02-06 13:00:35,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7866666666666666 [2025-02-06 13:00:35,182 INFO L175 Difference]: Start difference. First operand has 138 places, 128 transitions, 688 flow. Second operand 5 states and 413 transitions. [2025-02-06 13:00:35,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 181 transitions, 1113 flow [2025-02-06 13:00:35,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 181 transitions, 1078 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:00:35,187 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 698 flow [2025-02-06 13:00:35,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=698, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2025-02-06 13:00:35,188 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 44 predicate places. [2025-02-06 13:00:35,188 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 698 flow [2025-02-06 13:00:35,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:35,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:00:35,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:00:35,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:00:35,189 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 13:00:35,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:00:35,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1465225237, now seen corresponding path program 1 times [2025-02-06 13:00:35,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:00:35,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223872958] [2025-02-06 13:00:35,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:00:35,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:00:35,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:00:35,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:00:35,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:00:35,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:00:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:00:35,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:00:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223872958] [2025-02-06 13:00:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223872958] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:00:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782241643] [2025-02-06 13:00:35,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:00:35,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:00:35,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:00:35,342 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-02-06 13:00:35,346 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-02-06 13:00:35,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:00:35,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:00:35,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:00:35,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:00:35,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:00:35,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:00:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:00:35,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:00:35,514 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-02-06 13:00:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:00:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782241643] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:00:35,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:00:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-06 13:00:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211380247] [2025-02-06 13:00:35,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:00:35,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:00:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:00:35,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:00:35,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:00:35,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-06 13:00:35,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 698 flow. Second operand has 12 states, 12 states have (on average 65.33333333333333) internal successors, (784), 12 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:35,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:00:35,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-06 13:00:35,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:00:36,560 INFO L124 PetriNetUnfolderBase]: 4147/8251 cut-off events. [2025-02-06 13:00:36,560 INFO L125 PetriNetUnfolderBase]: For 6108/6531 co-relation queries the response was YES. [2025-02-06 13:00:36,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17985 conditions, 8251 events. 4147/8251 cut-off events. For 6108/6531 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 68220 event pairs, 1211 based on Foata normal form. 0/7221 useless extension candidates. Maximal degree in co-relation 16093. Up to 2183 conditions per place. [2025-02-06 13:00:36,607 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 128 selfloop transitions, 29 changer transitions 0/212 dead transitions. [2025-02-06 13:00:36,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 212 transitions, 1274 flow [2025-02-06 13:00:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:00:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:00:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2025-02-06 13:00:36,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511904761904762 [2025-02-06 13:00:36,612 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 698 flow. Second operand 8 states and 631 transitions. [2025-02-06 13:00:36,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 212 transitions, 1274 flow [2025-02-06 13:00:36,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 212 transitions, 1259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:00:36,630 INFO L231 Difference]: Finished difference. Result has 149 places, 132 transitions, 783 flow [2025-02-06 13:00:36,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=783, PETRI_PLACES=149, PETRI_TRANSITIONS=132} [2025-02-06 13:00:36,634 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 53 predicate places. [2025-02-06 13:00:36,634 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 132 transitions, 783 flow [2025-02-06 13:00:36,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.33333333333333) internal successors, (784), 12 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:36,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:00:36,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:00:36,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:00:36,835 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-02-06 13:00:36,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 13:00:36,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:00:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1465225236, now seen corresponding path program 1 times [2025-02-06 13:00:36,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:00:36,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717158370] [2025-02-06 13:00:36,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:00:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:00:36,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:00:36,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:00:36,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:00:36,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:00:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:00:36,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:00:36,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717158370] [2025-02-06 13:00:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717158370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:00:36,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:00:36,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:00:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329654751] [2025-02-06 13:00:36,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:00:36,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:00:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:00:36,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:00:36,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:00:36,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 105 [2025-02-06 13:00:36,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 132 transitions, 783 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:36,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:00:36,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 105 [2025-02-06 13:00:36,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:00:37,540 INFO L124 PetriNetUnfolderBase]: 4344/8984 cut-off events. [2025-02-06 13:00:37,540 INFO L125 PetriNetUnfolderBase]: For 8676/9120 co-relation queries the response was YES. [2025-02-06 13:00:37,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20319 conditions, 8984 events. 4344/8984 cut-off events. For 8676/9120 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 77253 event pairs, 2985 based on Foata normal form. 265/8456 useless extension candidates. Maximal degree in co-relation 18322. Up to 6219 conditions per place. [2025-02-06 13:00:37,588 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 63 selfloop transitions, 13 changer transitions 0/128 dead transitions. [2025-02-06 13:00:37,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 128 transitions, 927 flow [2025-02-06 13:00:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:00:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:00:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2025-02-06 13:00:37,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6452380952380953 [2025-02-06 13:00:37,702 INFO L175 Difference]: Start difference. First operand has 149 places, 132 transitions, 783 flow. Second operand 4 states and 271 transitions. [2025-02-06 13:00:37,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 128 transitions, 927 flow [2025-02-06 13:00:37,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 128 transitions, 889 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:00:37,711 INFO L231 Difference]: Finished difference. Result has 145 places, 128 transitions, 763 flow [2025-02-06 13:00:37,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=763, PETRI_PLACES=145, PETRI_TRANSITIONS=128} [2025-02-06 13:00:37,712 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 49 predicate places. [2025-02-06 13:00:37,712 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 128 transitions, 763 flow [2025-02-06 13:00:37,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:00:37,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:00:37,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:00:37,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 13:00:37,712 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-06 13:00:37,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:00:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1785708291, now seen corresponding path program 1 times [2025-02-06 13:00:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:00:37,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678498638] [2025-02-06 13:00:37,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:00:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:00:37,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:00:37,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:00:37,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:00:37,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:00:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:00:37,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:00:37,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678498638] [2025-02-06 13:00:37,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678498638] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:00:37,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053289085] [2025-02-06 13:00:37,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:00:37,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:00:37,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:00:37,911 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-02-06 13:00:37,918 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-02-06 13:00:37,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:00:37,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:00:37,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:00:37,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:00:37,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 13:00:37,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:00:37,989 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-02-06 13:00:38,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:00:38,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 14 treesize of output 9 [2025-02-06 13:00:38,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:00:38,026 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-02-06 13:00:38,040 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:00:38,040 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 14 treesize of output 13 [2025-02-06 13:00:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:00:38,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:00:38,582 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 100 treesize of output 96 [2025-02-06 13:00:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:00:38,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053289085] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:00:38,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:00:38,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 12 [2025-02-06 13:00:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004243168] [2025-02-06 13:00:38,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:00:38,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:00:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:00:38,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:00:38,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=1, NotChecked=0, Total=182 [2025-02-06 13:00:42,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:46,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:50,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:51,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:55,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:00:59,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:01:03,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:01:08,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]